./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 839c364b 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 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:54:34,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:54:34,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:54:34,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:54:34,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:54:34,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:54:34,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:54:34,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:54:34,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:54:34,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:54:34,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:54:34,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:54:34,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:54:34,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:54:34,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:54:34,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:54:34,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:54:34,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:54:34,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:54:34,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:54:34,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:54:34,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:54:34,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:54:34,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:54:34,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:54:34,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:54:34,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:54:34,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:54:34,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:54:34,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:54:34,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:54:34,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:54:34,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:54:34,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:54:34,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:54:34,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:54:34,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:54:34,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:54:34,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:54:34,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:54:34,478 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:54:34,480 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-14 23:54:34,501 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:54:34,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:54:34,502 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:54:34,502 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:54:34,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:54:34,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:54:34,503 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:54:34,503 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:54:34,503 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:54:34,503 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:54:34,504 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:54:34,504 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:54:34,504 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:54:34,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:54:34,505 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 23:54:34,505 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:54:34,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:54:34,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 23:54:34,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:54:34,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:54:34,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:54:34,505 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:54:34,506 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 23:54:34,506 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:54:34,507 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:54:34,507 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:54:34,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:54:34,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:54:34,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:54:34,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:54:34,508 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:54:34,508 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:54:34,509 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:54:34,509 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 -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2021-12-14 23:54:34,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:54:34,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:54:34,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:54:34,747 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:54:34,748 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:54:34,749 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-12-14 23:54:34,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f233290b/48c6eca8230b4575bd2ece00c6173dca/FLAGbb2fcb432 [2021-12-14 23:54:35,211 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:54:35,211 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2021-12-14 23:54:35,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f233290b/48c6eca8230b4575bd2ece00c6173dca/FLAGbb2fcb432 [2021-12-14 23:54:35,233 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f233290b/48c6eca8230b4575bd2ece00c6173dca [2021-12-14 23:54:35,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:54:35,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:54:35,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:54:35,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:54:35,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:54:35,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:54:35" (1/1) ... [2021-12-14 23:54:35,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dcd4cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:54:35, skipping insertion in model container [2021-12-14 23:54:35,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:54:35" (1/1) ... [2021-12-14 23:54:35,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:54:35,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:54:35,505 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:54:35,511 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:54:35,547 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:54:35,562 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:54:35,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:54:35 WrapperNode [2021-12-14 23:54:35,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:54:35,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:54:35,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:54:35,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:54:35,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:54:35" (1/1) ... [2021-12-14 23:54:35,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:54:35" (1/1) ... [2021-12-14 23:54:35,605 INFO L137 Inliner]: procedures = 116, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2021-12-14 23:54:35,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:54:35,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:54:35,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:54:35,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:54:35,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:54:35" (1/1) ... [2021-12-14 23:54:35,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:54:35" (1/1) ... [2021-12-14 23:54:35,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:54:35" (1/1) ... [2021-12-14 23:54:35,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:54:35" (1/1) ... [2021-12-14 23:54:35,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:54:35" (1/1) ... [2021-12-14 23:54:35,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:54:35" (1/1) ... [2021-12-14 23:54:35,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:54:35" (1/1) ... [2021-12-14 23:54:35,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:54:35,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:54:35,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:54:35,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:54:35,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:54:35" (1/1) ... [2021-12-14 23:54:35,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:35,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:35,658 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-12-14 23:54:35,660 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-12-14 23:54:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 23:54:35,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 23:54:35,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 23:54:35,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 23:54:35,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:54:35,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:54:35,742 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:54:35,743 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:54:35,868 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:54:35,872 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:54:35,872 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-14 23:54:35,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:54:35 BoogieIcfgContainer [2021-12-14 23:54:35,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:54:35,885 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:54:35,885 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:54:35,887 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:54:35,888 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:54:35,888 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:54:35" (1/3) ... [2021-12-14 23:54:35,889 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bcf4a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:54:35, skipping insertion in model container [2021-12-14 23:54:35,889 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:54:35,889 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:54:35" (2/3) ... [2021-12-14 23:54:35,889 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bcf4a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:54:35, skipping insertion in model container [2021-12-14 23:54:35,889 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:54:35,889 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:54:35" (3/3) ... [2021-12-14 23:54:35,890 INFO L388 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2021-12-14 23:54:35,920 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:54:35,921 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:54:35,921 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:54:35,921 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:54:35,921 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:54:35,921 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:54:35,921 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:54:35,921 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:54:35,932 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-12-14 23:54:35,954 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2021-12-14 23:54:35,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:35,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:35,958 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-14 23:54:35,958 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:54:35,958 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:54:35,958 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-12-14 23:54:35,960 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2021-12-14 23:54:35,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:35,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:35,961 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-14 23:54:35,961 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:54:35,965 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 11#L530true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 7#L530-2true call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 4#L535-3true [2021-12-14 23:54:35,969 INFO L793 eck$LassoCheckResult]: Loop: 4#L535-3true assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 17#L535-2true main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4#L535-3true [2021-12-14 23:54:35,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:35,976 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-12-14 23:54:35,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:35,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917052738] [2021-12-14 23:54:35,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:35,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:36,064 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:36,092 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:36,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:36,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-12-14 23:54:36,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:36,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034197525] [2021-12-14 23:54:36,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:36,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:36,114 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:36,129 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:36,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:36,131 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-12-14 23:54:36,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:36,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564227726] [2021-12-14 23:54:36,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:36,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:36,164 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:36,180 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:36,419 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:54:36,420 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:54:36,420 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:54:36,420 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:54:36,420 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:54:36,421 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:36,421 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:54:36,421 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:54:36,421 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2021-12-14 23:54:36,421 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:54:36,421 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:54:36,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:36,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:36,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:36,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:36,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:36,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:36,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-12-14 23:54:36,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-12-14 23:54:36,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-12-14 23:54:36,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-12-14 23:54:36,730 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:54:36,732 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:54:36,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:36,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:36,736 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-12-14 23:54:36,748 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-12-14 23:54:36,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:36,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:36,756 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-12-14 23:54:36,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:36,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:36,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:36,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:36,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:36,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:36,779 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-12-14 23:54:36,779 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:36,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:36,780 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-12-14 23:54:36,781 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-12-14 23:54:36,784 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-12-14 23:54:36,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:36,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:36,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:36,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:36,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:36,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:36,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:36,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-14 23:54:36,823 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:36,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:36,824 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-12-14 23:54:36,824 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-12-14 23:54:36,826 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-12-14 23:54:36,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:36,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:36,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:36,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:36,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:36,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:36,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:36,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:36,858 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-12-14 23:54:36,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:36,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:36,860 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-12-14 23:54:36,863 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-12-14 23:54:36,864 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-12-14 23:54:36,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:36,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:36,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:36,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:36,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:36,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:36,900 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:54:36,916 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-12-14 23:54:36,916 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-14 23:54:36,917 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:36,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:36,919 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-12-14 23:54:36,920 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-12-14 23:54:36,921 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:54:36,969 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-14 23:54:36,969 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:54:36,969 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_#t~malloc17#1.base)_1) = -2*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc17#1.base)_1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_1 - 2*ULTIMATE.start_main_~array_size~0#1 >= 0] [2021-12-14 23:54:37,019 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-12-14 23:54:37,027 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2021-12-14 23:54:37,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-14 23:54:37,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:37,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 23:54:37,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:37,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 23:54:37,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:54:37,207 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-14 23:54:37,208 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 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-12-14 23:54:37,271 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 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) Result 47 states and 74 transitions. Complement of second has 9 states. [2021-12-14 23:54:37,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-14 23:54:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. 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-12-14 23:54:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2021-12-14 23:54:37,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-14 23:54:37,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:54:37,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-14 23:54:37,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:54:37,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 4 letters. [2021-12-14 23:54:37,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:54:37,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 74 transitions. [2021-12-14 23:54:37,289 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-14 23:54:37,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 21 states and 33 transitions. [2021-12-14 23:54:37,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-12-14 23:54:37,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-14 23:54:37,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2021-12-14 23:54:37,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:54:37,295 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2021-12-14 23:54:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2021-12-14 23:54:37,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-14 23:54:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 20 states have internal predecessors, (33), 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-12-14 23:54:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2021-12-14 23:54:37,315 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2021-12-14 23:54:37,315 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2021-12-14 23:54:37,315 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:54:37,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 33 transitions. [2021-12-14 23:54:37,317 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-14 23:54:37,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:37,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:37,318 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-14 23:54:37,318 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:54:37,318 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 155#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 151#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 142#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 144#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 157#L517-3 [2021-12-14 23:54:37,319 INFO L793 eck$LassoCheckResult]: Loop: 157#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 156#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 157#L517-3 [2021-12-14 23:54:37,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:37,319 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-12-14 23:54:37,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:37,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111014752] [2021-12-14 23:54:37,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:37,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:54:37,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:54:37,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111014752] [2021-12-14 23:54:37,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111014752] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:54:37,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:54:37,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 23:54:37,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37150815] [2021-12-14 23:54:37,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:54:37,390 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:54:37,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:37,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2021-12-14 23:54:37,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:37,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957890305] [2021-12-14 23:54:37,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:37,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:37,408 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:37,416 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:37,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:54:37,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 23:54:37,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 23:54:37,480 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. cyclomatic complexity: 16 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-12-14 23:54:37,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:54:37,496 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2021-12-14 23:54:37,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 23:54:37,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2021-12-14 23:54:37,497 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-14 23:54:37,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2021-12-14 23:54:37,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-14 23:54:37,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-14 23:54:37,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-12-14 23:54:37,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:54:37,498 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-12-14 23:54:37,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-12-14 23:54:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-12-14 23:54:37,499 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-12-14 23:54:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2021-12-14 23:54:37,499 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2021-12-14 23:54:37,499 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2021-12-14 23:54:37,499 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:54:37,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2021-12-14 23:54:37,500 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-14 23:54:37,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:37,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:37,500 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:37,500 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:54:37,500 INFO L791 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 205#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 201#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 192#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 193#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 194#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 195#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 207#L517-3 [2021-12-14 23:54:37,500 INFO L793 eck$LassoCheckResult]: Loop: 207#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 206#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 207#L517-3 [2021-12-14 23:54:37,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-12-14 23:54:37,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:37,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115863841] [2021-12-14 23:54:37,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:37,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:37,528 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:37,537 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:37,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:37,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2021-12-14 23:54:37,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:37,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213870125] [2021-12-14 23:54:37,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:37,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:37,543 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:37,547 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:37,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:37,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2021-12-14 23:54:37,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:37,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919565539] [2021-12-14 23:54:37,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:37,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:37,561 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:37,581 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:38,109 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:54:38,109 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:54:38,109 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:54:38,109 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:54:38,110 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:54:38,110 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:38,110 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:54:38,110 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:54:38,110 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2021-12-14 23:54:38,110 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:54:38,110 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:54:38,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:38,858 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:54:38,858 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:54:38,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:38,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:38,860 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-12-14 23:54:38,860 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-12-14 23:54:38,863 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-12-14 23:54:38,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:38,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:38,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:38,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:38,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:38,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:38,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:38,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:38,887 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-12-14 23:54:38,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:38,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:38,889 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-12-14 23:54:38,892 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-12-14 23:54:38,894 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-12-14 23:54:38,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:38,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:38,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:38,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:38,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:38,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:38,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:38,901 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:38,916 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-12-14 23:54:38,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:38,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:38,917 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-12-14 23:54:38,918 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-12-14 23:54:38,919 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-12-14 23:54:38,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:38,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:38,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:38,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:38,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:38,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:38,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:38,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:38,952 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-12-14 23:54:38,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:38,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:38,953 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-12-14 23:54:38,954 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-12-14 23:54:38,955 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-12-14 23:54:38,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:38,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:38,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:38,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:38,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:38,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:38,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:38,974 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:38,992 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-12-14 23:54:38,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:38,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:38,993 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-12-14 23:54:38,997 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-12-14 23:54:38,999 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-12-14 23:54:39,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:39,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:39,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:39,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,026 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-12-14 23:54:39,026 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,027 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-12-14 23:54:39,028 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-12-14 23:54:39,029 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-12-14 23:54:39,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:39,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:39,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,073 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-12-14 23:54:39,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,075 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-12-14 23:54:39,081 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-12-14 23:54:39,082 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-12-14 23:54:39,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:39,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:39,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:39,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,108 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-12-14 23:54:39,109 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,110 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-12-14 23:54:39,111 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-12-14 23:54:39,114 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-12-14 23:54:39,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:39,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:39,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,140 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-12-14 23:54:39,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,141 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-12-14 23:54:39,142 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-12-14 23:54:39,143 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-12-14 23:54:39,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:39,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:39,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:39,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-12-14 23:54:39,170 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,171 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-12-14 23:54:39,171 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-12-14 23:54:39,172 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-12-14 23:54:39,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:39,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:39,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:39,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,209 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-12-14 23:54:39,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,211 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-12-14 23:54:39,213 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-12-14 23:54:39,213 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-12-14 23:54:39,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:39,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:39,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:39,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,241 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-12-14 23:54:39,242 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,242 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-12-14 23:54:39,243 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-12-14 23:54:39,246 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-12-14 23:54:39,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:39,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:39,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:39,257 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-14 23:54:39,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,276 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-12-14 23:54:39,277 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-12-14 23:54:39,278 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-12-14 23:54:39,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:39,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:39,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,305 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-12-14 23:54:39,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,306 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-12-14 23:54:39,308 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-12-14 23:54:39,309 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-12-14 23:54:39,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:39,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:39,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:39,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,331 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-12-14 23:54:39,332 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,333 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-12-14 23:54:39,335 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-12-14 23:54:39,336 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-12-14 23:54:39,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:39,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:39,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:39,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,359 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-12-14 23:54:39,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,360 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-12-14 23:54:39,365 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-12-14 23:54:39,366 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-12-14 23:54:39,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:39,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:39,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,410 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-12-14 23:54:39,410 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,411 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-12-14 23:54:39,412 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-12-14 23:54:39,413 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-12-14 23:54:39,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:39,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:39,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:39,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-12-14 23:54:39,438 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,439 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-12-14 23:54:39,440 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-12-14 23:54:39,441 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-12-14 23:54:39,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:39,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:39,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:39,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,475 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-12-14 23:54:39,475 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,481 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-12-14 23:54:39,481 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-12-14 23:54:39,482 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-12-14 23:54:39,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:39,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:39,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,511 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-12-14 23:54:39,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,512 INFO L229 MonitoredProcess]: Starting monitored process 26 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-12-14 23:54:39,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-14 23:54:39,514 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-12-14 23:54:39,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:39,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:39,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:39,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-14 23:54:39,548 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,548 INFO L229 MonitoredProcess]: Starting monitored process 27 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-12-14 23:54:39,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-14 23:54:39,551 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-12-14 23:54:39,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:39,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:39,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:39,569 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-12-14 23:54:39,589 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,590 INFO L229 MonitoredProcess]: Starting monitored process 28 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-12-14 23:54:39,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-14 23:54:39,596 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-12-14 23:54:39,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:39,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:39,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:39,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-14 23:54:39,625 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,625 INFO L229 MonitoredProcess]: Starting monitored process 29 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-12-14 23:54:39,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-14 23:54:39,628 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-12-14 23:54:39,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,639 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:39,639 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:39,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-12-14 23:54:39,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,665 INFO L229 MonitoredProcess]: Starting monitored process 30 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-12-14 23:54:39,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-14 23:54:39,666 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-12-14 23:54:39,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:39,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:39,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-12-14 23:54:39,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,702 INFO L229 MonitoredProcess]: Starting monitored process 31 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-12-14 23:54:39,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-14 23:54:39,703 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-12-14 23:54:39,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:39,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:39,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:39,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-12-14 23:54:39,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,740 INFO L229 MonitoredProcess]: Starting monitored process 32 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-12-14 23:54:39,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-14 23:54:39,742 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-12-14 23:54:39,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:39,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:39,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-12-14 23:54:39,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,766 INFO L229 MonitoredProcess]: Starting monitored process 33 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-12-14 23:54:39,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-14 23:54:39,767 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-12-14 23:54:39,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:39,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:39,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-12-14 23:54:39,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,794 INFO L229 MonitoredProcess]: Starting monitored process 34 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-12-14 23:54:39,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-14 23:54:39,797 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-12-14 23:54:39,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:39,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:39,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-12-14 23:54:39,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,840 INFO L229 MonitoredProcess]: Starting monitored process 35 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-12-14 23:54:39,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-14 23:54:39,842 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-12-14 23:54:39,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:39,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:39,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:39,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:39,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-12-14 23:54:39,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,880 INFO L229 MonitoredProcess]: Starting monitored process 36 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-12-14 23:54:39,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-14 23:54:39,882 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-12-14 23:54:39,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:39,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:39,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:39,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:39,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:39,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:39,923 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:54:39,940 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-14 23:54:39,941 INFO L444 ModelExtractionUtils]: 46 out of 61 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-12-14 23:54:39,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:39,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:39,942 INFO L229 MonitoredProcess]: Starting monitored process 37 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-12-14 23:54:39,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-14 23:54:39,944 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:54:39,972 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:54:39,972 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:54:39,972 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~N#1, ULTIMATE.start_lis_~i~0#1) = 1*ULTIMATE.start_lis_~N#1 - 1*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2021-12-14 23:54:39,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-12-14 23:54:40,034 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2021-12-14 23:54:40,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:40,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:54:40,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:40,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 23:54:40,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:54:40,108 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-12-14 23:54:40,108 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-12-14 23:54:40,117 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-12-14 23:54:40,118 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-12-14 23:54:40,118 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-12-14 23:54:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-12-14 23:54:40,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2021-12-14 23:54:40,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:54:40,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2021-12-14 23:54:40,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:54:40,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2021-12-14 23:54:40,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:54:40,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-12-14 23:54:40,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:54:40,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2021-12-14 23:54:40,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-14 23:54:40,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-14 23:54:40,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2021-12-14 23:54:40,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:54:40,120 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-12-14 23:54:40,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2021-12-14 23:54:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-14 23:54:40,121 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-12-14 23:54:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2021-12-14 23:54:40,121 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-12-14 23:54:40,121 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-12-14 23:54:40,121 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:54:40,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2021-12-14 23:54:40,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-14 23:54:40,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:40,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:40,122 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:40,122 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:54:40,122 INFO L791 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 380#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 388#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 384#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 375#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 376#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 377#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 378#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 395#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 396#L517-4 lis_~i~0#1 := 1; 387#L519-3 [2021-12-14 23:54:40,122 INFO L793 eck$LassoCheckResult]: Loop: 387#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 381#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 382#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 387#L519-3 [2021-12-14 23:54:40,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2021-12-14 23:54:40,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:40,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103394057] [2021-12-14 23:54:40,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:40,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:54:40,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:54:40,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103394057] [2021-12-14 23:54:40,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103394057] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:54:40,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:54:40,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 23:54:40,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127158454] [2021-12-14 23:54:40,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:54:40,156 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:54:40,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:40,156 INFO L85 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2021-12-14 23:54:40,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:40,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466330176] [2021-12-14 23:54:40,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:40,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:40,158 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:40,160 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:40,178 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:54:40,178 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:54:40,178 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:54:40,178 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:54:40,178 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-14 23:54:40,178 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:40,178 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:54:40,178 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:54:40,178 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2021-12-14 23:54:40,179 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:54:40,179 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:54:40,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:40,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:40,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-12-14 23:54:40,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:40,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:40,232 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:54:40,233 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-14 23:54:40,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:40,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:40,235 INFO L229 MonitoredProcess]: Starting monitored process 38 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-12-14 23:54:40,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-14 23:54:40,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-14 23:54:40,238 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-14 23:54:40,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-12-14 23:54:40,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:40,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:40,263 INFO L229 MonitoredProcess]: Starting monitored process 39 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-12-14 23:54:40,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-14 23:54:40,265 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-14 23:54:40,265 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-14 23:54:40,374 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-14 23:54:40,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-12-14 23:54:40,377 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:54:40,377 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:54:40,377 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:54:40,378 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:54:40,378 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:54:40,378 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:40,378 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:54:40,378 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:54:40,378 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2021-12-14 23:54:40,378 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:54:40,378 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:54:40,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:40,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:40,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:40,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:40,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:40,442 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:54:40,443 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:54:40,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:40,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:40,444 INFO L229 MonitoredProcess]: Starting monitored process 40 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-12-14 23:54:40,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-14 23:54:40,446 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-12-14 23:54:40,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:40,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:40,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:40,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:40,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:40,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:40,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:40,475 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:54:40,476 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-14 23:54:40,476 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-14 23:54:40,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:40,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:40,477 INFO L229 MonitoredProcess]: Starting monitored process 41 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-12-14 23:54:40,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-14 23:54:40,479 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:54:40,479 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-14 23:54:40,479 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:54:40,479 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 1 Supporting invariants [] [2021-12-14 23:54:40,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-12-14 23:54:40,496 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-14 23:54:40,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:40,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:54:40,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:40,542 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 23:54:40,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:40,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-12-14 23:54:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:54:40,602 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-12-14 23:54:40,603 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-12-14 23:54:40,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-12-14 23:54:40,644 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-12-14 23:54:40,644 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-12-14 23:54:40,645 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-12-14 23:54:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-12-14 23:54:40,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2021-12-14 23:54:40,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:54:40,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2021-12-14 23:54:40,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:54:40,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2021-12-14 23:54:40,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:54:40,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 67 transitions. [2021-12-14 23:54:40,648 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2021-12-14 23:54:40,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 62 transitions. [2021-12-14 23:54:40,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-12-14 23:54:40,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-12-14 23:54:40,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2021-12-14 23:54:40,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:54:40,649 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 62 transitions. [2021-12-14 23:54:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2021-12-14 23:54:40,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2021-12-14 23:54:40,650 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-12-14 23:54:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2021-12-14 23:54:40,651 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 50 transitions. [2021-12-14 23:54:40,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:54:40,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 23:54:40,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 23:54:40,652 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-12-14 23:54:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:54:40,682 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2021-12-14 23:54:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 23:54:40,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2021-12-14 23:54:40,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-14 23:54:40,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2021-12-14 23:54:40,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-14 23:54:40,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-14 23:54:40,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2021-12-14 23:54:40,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:54:40,685 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2021-12-14 23:54:40,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2021-12-14 23:54:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-14 23:54:40,686 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-12-14 23:54:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2021-12-14 23:54:40,686 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2021-12-14 23:54:40,686 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2021-12-14 23:54:40,686 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:54:40,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2021-12-14 23:54:40,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-14 23:54:40,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:40,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:40,687 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:40,687 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:40,687 INFO L791 eck$LassoCheckResult]: Stem: 581#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 582#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 596#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 588#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 577#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 578#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 579#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 580#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 605#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 597#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 598#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 606#L517-4 lis_~i~0#1 := 1; 607#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 583#L520-3 [2021-12-14 23:54:40,687 INFO L793 eck$LassoCheckResult]: Loop: 583#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 584#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 589#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 590#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 601#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 593#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 594#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 583#L520-3 [2021-12-14 23:54:40,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2021-12-14 23:54:40,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:40,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322884316] [2021-12-14 23:54:40,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:40,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:54:40,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:54:40,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322884316] [2021-12-14 23:54:40,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322884316] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:54:40,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646366984] [2021-12-14 23:54:40,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:40,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:54:40,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:40,731 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:54:40,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-12-14 23:54:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:40,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 23:54:40,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:40,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:54:40,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:54:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:54:40,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646366984] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:54:40,847 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:54:40,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-12-14 23:54:40,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765962578] [2021-12-14 23:54:40,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:54:40,847 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:54:40,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:40,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2021-12-14 23:54:40,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:40,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115303769] [2021-12-14 23:54:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:40,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:40,855 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:40,863 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:41,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:54:41,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 23:54:41,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-14 23:54:41,025 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. cyclomatic complexity: 21 Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 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-12-14 23:54:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:54:41,129 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2021-12-14 23:54:41,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 23:54:41,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 71 transitions. [2021-12-14 23:54:41,130 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-12-14 23:54:41,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 71 transitions. [2021-12-14 23:54:41,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-14 23:54:41,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-14 23:54:41,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 71 transitions. [2021-12-14 23:54:41,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:54:41,131 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 71 transitions. [2021-12-14 23:54:41,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 71 transitions. [2021-12-14 23:54:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2021-12-14 23:54:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 44 states have internal predecessors, (64), 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-12-14 23:54:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2021-12-14 23:54:41,133 INFO L704 BuchiCegarLoop]: Abstraction has 45 states and 64 transitions. [2021-12-14 23:54:41,133 INFO L587 BuchiCegarLoop]: Abstraction has 45 states and 64 transitions. [2021-12-14 23:54:41,133 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-14 23:54:41,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 64 transitions. [2021-12-14 23:54:41,136 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-14 23:54:41,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:41,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:41,137 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:41,137 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:54:41,137 INFO L791 eck$LassoCheckResult]: Stem: 763#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 764#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 780#L530 assume main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911;main_~array_size~0#1 := 1; 783#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 758#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 759#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 776#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 800#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 799#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 798#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 797#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 796#L517-4 lis_~i~0#1 := 1; 784#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 785#L519-4 lis_~i~0#1 := 0; 789#L523-3 [2021-12-14 23:54:41,137 INFO L793 eck$LassoCheckResult]: Loop: 789#L523-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem14#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 790#L524 assume lis_~max~0#1 < lis_#t~mem14#1;havoc lis_#t~mem14#1;call lis_#t~mem15#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem15#1;havoc lis_#t~mem15#1; 791#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 789#L523-3 [2021-12-14 23:54:41,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:41,137 INFO L85 PathProgramCache]: Analyzing trace with hash -520179462, now seen corresponding path program 1 times [2021-12-14 23:54:41,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:41,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393305329] [2021-12-14 23:54:41,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:41,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:41,165 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:41,177 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:41,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:41,178 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2021-12-14 23:54:41,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:41,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705326720] [2021-12-14 23:54:41,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:41,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:41,181 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:41,183 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:41,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:41,184 INFO L85 PathProgramCache]: Analyzing trace with hash -424266948, now seen corresponding path program 1 times [2021-12-14 23:54:41,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:41,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934415074] [2021-12-14 23:54:41,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:41,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:41,196 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:41,207 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:41,908 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:54:41,908 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:54:41,908 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:54:41,908 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:54:41,908 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:54:41,908 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:41,908 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:54:41,908 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:54:41,908 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration6_Lasso [2021-12-14 23:54:41,908 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:54:41,908 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:54:41,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:41,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:41,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:41,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:41,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:41,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:41,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:41,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:41,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:41,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:41,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:41,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:41,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:41,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:41,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:42,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:42,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:42,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:42,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:42,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:42,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:42,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:42,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:54:42,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-12-14 23:54:42,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-12-14 23:54:42,568 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:54:42,569 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:54:42,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:42,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:42,587 INFO L229 MonitoredProcess]: Starting monitored process 43 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-12-14 23:54:42,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-14 23:54:42,589 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-12-14 23:54:42,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:42,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:42,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:42,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:42,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:42,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:42,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:42,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:42,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-12-14 23:54:42,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:42,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:42,618 INFO L229 MonitoredProcess]: Starting monitored process 44 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-12-14 23:54:42,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-14 23:54:42,620 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-12-14 23:54:42,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:42,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:42,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:42,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:42,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:42,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:42,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:42,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:42,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-12-14 23:54:42,654 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:42,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:42,655 INFO L229 MonitoredProcess]: Starting monitored process 45 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-12-14 23:54:42,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-14 23:54:42,656 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-12-14 23:54:42,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:42,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:42,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:42,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:42,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:42,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:42,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:42,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:42,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-12-14 23:54:42,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:42,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:42,680 INFO L229 MonitoredProcess]: Starting monitored process 46 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-12-14 23:54:42,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-14 23:54:42,682 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-12-14 23:54:42,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:42,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:42,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:42,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:42,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:42,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:42,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:42,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:42,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-12-14 23:54:42,704 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:42,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:42,705 INFO L229 MonitoredProcess]: Starting monitored process 47 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-12-14 23:54:42,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-14 23:54:42,706 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-12-14 23:54:42,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:42,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:42,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:42,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:42,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:42,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:42,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:42,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-12-14 23:54:42,729 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:42,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:42,730 INFO L229 MonitoredProcess]: Starting monitored process 48 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-12-14 23:54:42,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-14 23:54:42,732 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-12-14 23:54:42,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:42,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:42,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:42,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:42,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:42,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:42,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:42,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:42,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-12-14 23:54:42,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:42,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:42,764 INFO L229 MonitoredProcess]: Starting monitored process 49 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-12-14 23:54:42,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-14 23:54:42,766 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-12-14 23:54:42,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:42,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:42,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:42,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:42,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:42,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:42,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:42,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:42,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-12-14 23:54:42,788 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:42,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:42,788 INFO L229 MonitoredProcess]: Starting monitored process 50 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-12-14 23:54:42,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-14 23:54:42,790 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-12-14 23:54:42,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:42,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:42,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:42,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:42,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:42,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:42,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:42,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2021-12-14 23:54:42,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:42,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:42,814 INFO L229 MonitoredProcess]: Starting monitored process 51 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-12-14 23:54:42,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-14 23:54:42,816 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-12-14 23:54:42,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:42,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:42,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:42,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:42,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:42,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:42,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:42,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:42,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-12-14 23:54:42,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:42,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:42,838 INFO L229 MonitoredProcess]: Starting monitored process 52 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-12-14 23:54:42,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-14 23:54:42,840 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-12-14 23:54:42,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:42,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:42,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:42,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:42,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:42,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:42,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:42,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:42,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-12-14 23:54:42,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:42,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:42,888 INFO L229 MonitoredProcess]: Starting monitored process 53 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-12-14 23:54:42,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-14 23:54:42,890 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-12-14 23:54:42,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:42,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:42,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:42,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:42,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:42,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:42,898 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:42,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-12-14 23:54:42,913 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:42,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:42,913 INFO L229 MonitoredProcess]: Starting monitored process 54 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-12-14 23:54:42,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-14 23:54:42,915 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-12-14 23:54:42,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:42,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:42,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:42,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:42,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:42,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:42,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:42,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:42,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-12-14 23:54:42,936 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:42,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:42,937 INFO L229 MonitoredProcess]: Starting monitored process 55 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-12-14 23:54:42,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-14 23:54:42,939 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-12-14 23:54:42,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:42,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:42,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:42,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:42,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:42,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:42,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:42,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:42,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-12-14 23:54:42,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:42,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:42,961 INFO L229 MonitoredProcess]: Starting monitored process 56 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-12-14 23:54:42,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-12-14 23:54:42,963 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-12-14 23:54:42,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:42,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:54:42,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:42,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:42,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:42,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:54:42,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:54:42,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:42,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2021-12-14 23:54:42,986 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:42,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:42,987 INFO L229 MonitoredProcess]: Starting monitored process 57 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-12-14 23:54:42,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-14 23:54:42,989 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-12-14 23:54:42,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:42,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:42,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:42,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:43,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:43,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:43,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:54:43,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-12-14 23:54:43,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:43,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:43,026 INFO L229 MonitoredProcess]: Starting monitored process 58 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-12-14 23:54:43,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-14 23:54:43,028 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-12-14 23:54:43,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:54:43,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:54:43,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:54:43,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:54:43,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:54:43,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:54:43,070 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:54:43,101 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2021-12-14 23:54:43,101 INFO L444 ModelExtractionUtils]: 38 out of 58 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-12-14 23:54:43,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:54:43,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:43,102 INFO L229 MonitoredProcess]: Starting monitored process 59 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-12-14 23:54:43,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-14 23:54:43,103 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:54:43,110 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-14 23:54:43,110 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:54:43,110 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_#t~malloc2#1.base)_2, ULTIMATE.start_lis_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_lis_#t~malloc2#1.base)_2 - 4*ULTIMATE.start_lis_~i~0#1 Supporting invariants [1*ULTIMATE.start_lis_~best~0#1.offset >= 0] [2021-12-14 23:54:43,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2021-12-14 23:54:43,152 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2021-12-14 23:54:43,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:43,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 23:54:43,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:43,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 23:54:43,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:54:43,294 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-14 23:54:43,294 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 64 transitions. cyclomatic complexity: 26 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-12-14 23:54:43,343 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 64 transitions. cyclomatic complexity: 26. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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) Result 50 states and 71 transitions. Complement of second has 6 states. [2021-12-14 23:54:43,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-14 23:54:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-12-14 23:54:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2021-12-14 23:54:43,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 14 letters. Loop has 3 letters. [2021-12-14 23:54:43,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:54:43,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 17 letters. Loop has 3 letters. [2021-12-14 23:54:43,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:54:43,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 14 letters. Loop has 6 letters. [2021-12-14 23:54:43,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:54:43,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 71 transitions. [2021-12-14 23:54:43,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-14 23:54:43,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 32 states and 43 transitions. [2021-12-14 23:54:43,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-12-14 23:54:43,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-12-14 23:54:43,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2021-12-14 23:54:43,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:54:43,347 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2021-12-14 23:54:43,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2021-12-14 23:54:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2021-12-14 23:54:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 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-12-14 23:54:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2021-12-14 23:54:43,348 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2021-12-14 23:54:43,348 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2021-12-14 23:54:43,348 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-14 23:54:43,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2021-12-14 23:54:43,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-14 23:54:43,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:43,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:43,349 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:43,349 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:43,349 INFO L791 eck$LassoCheckResult]: Stem: 1003#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1004#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1018#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1010#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 999#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1000#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1001#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1002#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1029#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1023#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1024#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1019#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1020#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1025#L517-4 lis_~i~0#1 := 1; 1026#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1005#L520-3 [2021-12-14 23:54:43,349 INFO L793 eck$LassoCheckResult]: Loop: 1005#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1006#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1011#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1012#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1022#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1015#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1016#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1005#L520-3 [2021-12-14 23:54:43,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:43,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1166516274, now seen corresponding path program 2 times [2021-12-14 23:54:43,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:43,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532851634] [2021-12-14 23:54:43,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:43,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:54:43,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:54:43,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532851634] [2021-12-14 23:54:43,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532851634] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:54:43,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287742778] [2021-12-14 23:54:43,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:54:43,392 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:54:43,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:43,392 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:54:43,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2021-12-14 23:54:43,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:54:43,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:54:43,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 23:54:43,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 23:54:43,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:54:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 23:54:43,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287742778] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:54:43,518 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:54:43,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2021-12-14 23:54:43,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237941972] [2021-12-14 23:54:43,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:54:43,520 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:54:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:43,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2021-12-14 23:54:43,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:43,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189195889] [2021-12-14 23:54:43,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:43,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:43,533 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:43,548 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:43,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:54:43,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 23:54:43,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-12-14 23:54:43,673 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 15 Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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-12-14 23:54:43,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:54:43,785 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2021-12-14 23:54:43,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 23:54:43,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 65 transitions. [2021-12-14 23:54:43,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-14 23:54:43,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 65 transitions. [2021-12-14 23:54:43,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-12-14 23:54:43,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-12-14 23:54:43,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 65 transitions. [2021-12-14 23:54:43,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:54:43,787 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 65 transitions. [2021-12-14 23:54:43,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 65 transitions. [2021-12-14 23:54:43,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2021-12-14 23:54:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 32 states have internal predecessors, (44), 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-12-14 23:54:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2021-12-14 23:54:43,789 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2021-12-14 23:54:43,789 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2021-12-14 23:54:43,790 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-14 23:54:43,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2021-12-14 23:54:43,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-14 23:54:43,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:43,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:43,790 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:43,790 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:43,791 INFO L791 eck$LassoCheckResult]: Stem: 1193#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1194#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1209#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1200#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1189#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1190#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1191#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1192#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1208#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1214#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1215#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1218#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1219#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1210#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1211#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1216#L517-4 lis_~i~0#1 := 1; 1217#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1195#L520-3 [2021-12-14 23:54:43,791 INFO L793 eck$LassoCheckResult]: Loop: 1195#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1196#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1201#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1202#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1213#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1205#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1206#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1195#L520-3 [2021-12-14 23:54:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:43,791 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 3 times [2021-12-14 23:54:43,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:43,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119280659] [2021-12-14 23:54:43,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:43,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:43,829 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:43,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2021-12-14 23:54:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:43,853 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:43,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:43,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 3 times [2021-12-14 23:54:43,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:43,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81872542] [2021-12-14 23:54:43,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:43,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:43,858 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:43,861 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:43,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:43,861 INFO L85 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2021-12-14 23:54:43,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:43,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365311281] [2021-12-14 23:54:43,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:43,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 23:54:43,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:54:43,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365311281] [2021-12-14 23:54:43,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365311281] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:54:43,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650042614] [2021-12-14 23:54:43,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:43,913 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:54:43,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:43,914 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:54:43,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2021-12-14 23:54:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:43,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 23:54:43,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 23:54:44,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:54:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 23:54:44,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650042614] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:54:44,077 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:54:44,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2021-12-14 23:54:44,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378073007] [2021-12-14 23:54:44,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:54:44,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:54:44,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 23:54:44,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-12-14 23:54:44,209 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. cyclomatic complexity: 15 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-12-14 23:54:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:54:44,299 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2021-12-14 23:54:44,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 23:54:44,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 78 transitions. [2021-12-14 23:54:44,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-14 23:54:44,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 49 states and 64 transitions. [2021-12-14 23:54:44,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-12-14 23:54:44,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-12-14 23:54:44,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 64 transitions. [2021-12-14 23:54:44,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:54:44,301 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2021-12-14 23:54:44,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 64 transitions. [2021-12-14 23:54:44,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2021-12-14 23:54:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 46 states have internal predecessors, (62), 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-12-14 23:54:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2021-12-14 23:54:44,304 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-12-14 23:54:44,304 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-12-14 23:54:44,304 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-14 23:54:44,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2021-12-14 23:54:44,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-14 23:54:44,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:44,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:44,305 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:44,305 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:54:44,305 INFO L791 eck$LassoCheckResult]: Stem: 1452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1453#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1467#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1459#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1448#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1449#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1450#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1451#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1492#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1491#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1490#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1488#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1487#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1486#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1485#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1483#L517-4 lis_~i~0#1 := 1; 1470#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1471#L520-3 [2021-12-14 23:54:44,306 INFO L793 eck$LassoCheckResult]: Loop: 1471#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1481#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1480#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1473#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1471#L520-3 [2021-12-14 23:54:44,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:44,306 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 4 times [2021-12-14 23:54:44,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:44,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887084645] [2021-12-14 23:54:44,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:44,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:44,316 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:44,325 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:44,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 1 times [2021-12-14 23:54:44,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:44,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078561632] [2021-12-14 23:54:44,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:44,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:44,328 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:44,331 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:44,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:44,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2057178037, now seen corresponding path program 1 times [2021-12-14 23:54:44,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:44,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595020140] [2021-12-14 23:54:44,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:44,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:54:44,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:54:44,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595020140] [2021-12-14 23:54:44,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595020140] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:54:44,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482088079] [2021-12-14 23:54:44,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:44,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:54:44,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:44,573 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:54:44,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2021-12-14 23:54:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:44,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-14 23:54:44,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:44,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-14 23:54:44,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-12-14 23:54:44,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 23:54:44,746 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 23:54:44,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-12-14 23:54:44,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-14 23:54:44,835 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 23:54:44,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2021-12-14 23:54:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 23:54:44,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:54:44,964 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_341 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2021-12-14 23:54:44,973 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:54:44,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 72 [2021-12-14 23:54:44,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 115 [2021-12-14 23:54:44,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:54:44,989 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:54:44,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 134 [2021-12-14 23:54:44,997 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 23:54:44,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 110 [2021-12-14 23:54:45,011 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 23:54:45,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 97 [2021-12-14 23:54:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2021-12-14 23:54:45,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482088079] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:54:45,114 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:54:45,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 25 [2021-12-14 23:54:45,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331493624] [2021-12-14 23:54:45,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:54:45,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:54:45,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-14 23:54:45,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=463, Unknown=6, NotChecked=44, Total=600 [2021-12-14 23:54:45,213 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 21 Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 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-12-14 23:54:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:54:45,450 INFO L93 Difference]: Finished difference Result 117 states and 165 transitions. [2021-12-14 23:54:45,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 23:54:45,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 165 transitions. [2021-12-14 23:54:45,452 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2021-12-14 23:54:45,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 165 transitions. [2021-12-14 23:54:45,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2021-12-14 23:54:45,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2021-12-14 23:54:45,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 165 transitions. [2021-12-14 23:54:45,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:54:45,455 INFO L681 BuchiCegarLoop]: Abstraction has 117 states and 165 transitions. [2021-12-14 23:54:45,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 165 transitions. [2021-12-14 23:54:45,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 76. [2021-12-14 23:54:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.381578947368421) internal successors, (105), 75 states have internal predecessors, (105), 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-12-14 23:54:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 105 transitions. [2021-12-14 23:54:45,461 INFO L704 BuchiCegarLoop]: Abstraction has 76 states and 105 transitions. [2021-12-14 23:54:45,461 INFO L587 BuchiCegarLoop]: Abstraction has 76 states and 105 transitions. [2021-12-14 23:54:45,461 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-14 23:54:45,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 105 transitions. [2021-12-14 23:54:45,462 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-14 23:54:45,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:45,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:45,462 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:45,462 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:54:45,462 INFO L791 eck$LassoCheckResult]: Stem: 1776#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1777#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1791#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1783#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1772#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1773#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1774#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1775#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1809#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1811#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1805#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1806#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1807#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1808#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1841#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1839#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1838#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1837#L517-4 lis_~i~0#1 := 1; 1835#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1832#L520-3 [2021-12-14 23:54:45,463 INFO L793 eck$LassoCheckResult]: Loop: 1832#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1830#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1827#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1828#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1832#L520-3 [2021-12-14 23:54:45,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:45,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1572565998, now seen corresponding path program 5 times [2021-12-14 23:54:45,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:45,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848315424] [2021-12-14 23:54:45,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:45,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:54:45,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:54:45,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848315424] [2021-12-14 23:54:45,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848315424] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:54:45,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25183976] [2021-12-14 23:54:45,520 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 23:54:45,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:54:45,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:45,521 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:54:45,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2021-12-14 23:54:45,603 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-14 23:54:45,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:54:45,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 23:54:45,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:45,689 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:54:45,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:54:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:54:45,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25183976] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:54:45,733 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:54:45,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-14 23:54:45,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555954337] [2021-12-14 23:54:45,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:54:45,734 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:54:45,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:45,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 2 times [2021-12-14 23:54:45,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:45,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311512038] [2021-12-14 23:54:45,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:45,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:45,738 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:45,741 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:45,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:54:45,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 23:54:45,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-12-14 23:54:45,831 INFO L87 Difference]: Start difference. First operand 76 states and 105 transitions. cyclomatic complexity: 35 Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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-12-14 23:54:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:54:45,919 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2021-12-14 23:54:45,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 23:54:45,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 100 transitions. [2021-12-14 23:54:45,920 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-14 23:54:45,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 100 transitions. [2021-12-14 23:54:45,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2021-12-14 23:54:45,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-12-14 23:54:45,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 100 transitions. [2021-12-14 23:54:45,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:54:45,921 INFO L681 BuchiCegarLoop]: Abstraction has 73 states and 100 transitions. [2021-12-14 23:54:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 100 transitions. [2021-12-14 23:54:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2021-12-14 23:54:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.375) internal successors, (99), 71 states have internal predecessors, (99), 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-12-14 23:54:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2021-12-14 23:54:45,923 INFO L704 BuchiCegarLoop]: Abstraction has 72 states and 99 transitions. [2021-12-14 23:54:45,923 INFO L587 BuchiCegarLoop]: Abstraction has 72 states and 99 transitions. [2021-12-14 23:54:45,923 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-14 23:54:45,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 99 transitions. [2021-12-14 23:54:45,923 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-14 23:54:45,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:45,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:45,924 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:45,924 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:54:45,924 INFO L791 eck$LassoCheckResult]: Stem: 2058#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2059#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2073#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2064#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 2054#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2055#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2056#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2057#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2125#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2124#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2121#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2074#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2075#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2118#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2117#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2087#L517-4 lis_~i~0#1 := 1; 2078#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2079#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2123#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2065#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2066#L520-2 [2021-12-14 23:54:45,924 INFO L793 eck$LassoCheckResult]: Loop: 2066#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2120#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2119#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2083#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2066#L520-2 [2021-12-14 23:54:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1451833899, now seen corresponding path program 1 times [2021-12-14 23:54:45,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:45,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863463562] [2021-12-14 23:54:45,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:45,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:45,937 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:45,951 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:45,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:45,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2942460, now seen corresponding path program 3 times [2021-12-14 23:54:45,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:45,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037875355] [2021-12-14 23:54:45,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:45,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:45,955 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:45,958 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:45,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:45,959 INFO L85 PathProgramCache]: Analyzing trace with hash 500759334, now seen corresponding path program 1 times [2021-12-14 23:54:45,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:45,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506611541] [2021-12-14 23:54:45,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:45,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:45,991 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 23:54:45,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:54:45,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506611541] [2021-12-14 23:54:45,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506611541] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:54:45,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309256872] [2021-12-14 23:54:45,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:45,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:54:45,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:45,993 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:54:45,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2021-12-14 23:54:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:46,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 23:54:46,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 23:54:46,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 23:54:46,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309256872] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:54:46,107 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 23:54:46,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2021-12-14 23:54:46,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454748606] [2021-12-14 23:54:46,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:54:46,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:54:46,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 23:54:46,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-12-14 23:54:46,199 INFO L87 Difference]: Start difference. First operand 72 states and 99 transitions. cyclomatic complexity: 32 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-12-14 23:54:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:54:46,230 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2021-12-14 23:54:46,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 23:54:46,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 103 transitions. [2021-12-14 23:54:46,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-14 23:54:46,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 64 states and 86 transitions. [2021-12-14 23:54:46,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-14 23:54:46,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-14 23:54:46,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 86 transitions. [2021-12-14 23:54:46,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:54:46,232 INFO L681 BuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2021-12-14 23:54:46,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 86 transitions. [2021-12-14 23:54:46,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2021-12-14 23:54:46,234 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-12-14 23:54:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2021-12-14 23:54:46,234 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2021-12-14 23:54:46,234 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2021-12-14 23:54:46,234 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-14 23:54:46,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2021-12-14 23:54:46,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-14 23:54:46,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:46,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:46,235 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-12-14 23:54:46,235 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:46,236 INFO L791 eck$LassoCheckResult]: Stem: 2292#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2293#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2307#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2298#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 2288#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2289#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2290#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2291#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2325#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2324#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2323#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2318#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2319#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2308#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2309#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2322#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2326#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2327#L517-4 lis_~i~0#1 := 1; 2332#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2333#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2314#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2299#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2300#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2312#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2303#L519-2 [2021-12-14 23:54:46,236 INFO L793 eck$LassoCheckResult]: Loop: 2303#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2304#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2294#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2295#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2337#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2336#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2335#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2303#L519-2 [2021-12-14 23:54:46,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:46,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2021-12-14 23:54:46,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:46,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250835659] [2021-12-14 23:54:46,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:46,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:46,293 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:54:46,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:54:46,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250835659] [2021-12-14 23:54:46,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250835659] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:54:46,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608380881] [2021-12-14 23:54:46,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:46,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:54:46,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:46,295 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:54:46,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2021-12-14 23:54:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:46,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 23:54:46,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:46,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:54:46,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:54:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:54:46,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608380881] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:54:46,491 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:54:46,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-14 23:54:46,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614607384] [2021-12-14 23:54:46,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:54:46,492 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:54:46,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:46,492 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 4 times [2021-12-14 23:54:46,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:46,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194273329] [2021-12-14 23:54:46,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:46,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:46,496 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:46,499 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:46,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:54:46,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 23:54:46,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-14 23:54:46,616 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. cyclomatic complexity: 24 Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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-12-14 23:54:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:54:46,697 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2021-12-14 23:54:46,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 23:54:46,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2021-12-14 23:54:46,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-14 23:54:46,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 64 transitions. [2021-12-14 23:54:46,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-12-14 23:54:46,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-12-14 23:54:46,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2021-12-14 23:54:46,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:54:46,698 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2021-12-14 23:54:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2021-12-14 23:54:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2021-12-14 23:54:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 46 states have internal predecessors, (63), 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-12-14 23:54:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2021-12-14 23:54:46,700 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2021-12-14 23:54:46,700 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2021-12-14 23:54:46,700 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-14 23:54:46,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 63 transitions. [2021-12-14 23:54:46,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-14 23:54:46,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:46,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:46,700 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:46,700 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:46,700 INFO L791 eck$LassoCheckResult]: Stem: 2560#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2561#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2574#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2566#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 2556#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2557#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2558#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2559#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2591#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2589#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2588#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2582#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2583#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2586#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2599#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2575#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2576#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2587#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2590#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2584#L517-4 lis_~i~0#1 := 1; 2585#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2598#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2593#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2592#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2562#L520-3 [2021-12-14 23:54:46,700 INFO L793 eck$LassoCheckResult]: Loop: 2562#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2563#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2580#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2595#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2594#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2571#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2572#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2562#L520-3 [2021-12-14 23:54:46,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:46,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1572106802, now seen corresponding path program 1 times [2021-12-14 23:54:46,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:46,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023882779] [2021-12-14 23:54:46,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:46,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 23:54:46,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:54:46,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023882779] [2021-12-14 23:54:46,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023882779] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:54:46,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:54:46,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 23:54:46,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014170837] [2021-12-14 23:54:46,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:54:46,732 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:54:46,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:46,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 5 times [2021-12-14 23:54:46,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:46,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019317175] [2021-12-14 23:54:46,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:46,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:46,736 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:46,739 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:46,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:54:46,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 23:54:46,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 23:54:46,871 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-12-14 23:54:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:54:46,889 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2021-12-14 23:54:46,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 23:54:46,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2021-12-14 23:54:46,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-14 23:54:46,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 64 transitions. [2021-12-14 23:54:46,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-12-14 23:54:46,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-12-14 23:54:46,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 64 transitions. [2021-12-14 23:54:46,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:54:46,890 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2021-12-14 23:54:46,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 64 transitions. [2021-12-14 23:54:46,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2021-12-14 23:54:46,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 46 states have internal predecessors, (62), 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-12-14 23:54:46,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2021-12-14 23:54:46,891 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-12-14 23:54:46,891 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-12-14 23:54:46,891 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-14 23:54:46,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2021-12-14 23:54:46,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-14 23:54:46,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:46,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:46,892 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:46,892 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:46,892 INFO L791 eck$LassoCheckResult]: Stem: 2663#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2664#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2677#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2669#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 2659#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2660#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2661#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2662#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2696#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2693#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2692#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2687#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2688#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2678#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2679#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2691#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2697#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2695#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2694#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2689#L517-4 lis_~i~0#1 := 1; 2690#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2665#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2666#L521 assume !lis_#t~short11#1; 2670#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2671#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2682#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2674#L519-2 [2021-12-14 23:54:46,892 INFO L793 eck$LassoCheckResult]: Loop: 2674#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2675#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2680#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2701#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2703#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2702#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2700#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2674#L519-2 [2021-12-14 23:54:46,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:46,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1035359454, now seen corresponding path program 1 times [2021-12-14 23:54:46,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:46,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103257987] [2021-12-14 23:54:46,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:46,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:46,911 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 23:54:46,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:54:46,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103257987] [2021-12-14 23:54:46,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103257987] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:54:46,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:54:46,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:54:46,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457504078] [2021-12-14 23:54:46,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:54:46,912 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:54:46,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:46,913 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 6 times [2021-12-14 23:54:46,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:46,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115612705] [2021-12-14 23:54:46,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:46,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:46,916 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:46,919 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:47,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:54:47,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:54:47,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:54:47,046 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 19 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-12-14 23:54:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:54:47,052 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2021-12-14 23:54:47,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:54:47,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 66 transitions. [2021-12-14 23:54:47,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-14 23:54:47,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 66 transitions. [2021-12-14 23:54:47,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-12-14 23:54:47,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-12-14 23:54:47,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2021-12-14 23:54:47,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:54:47,054 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2021-12-14 23:54:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2021-12-14 23:54:47,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-14 23:54:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 50 states have internal predecessors, (66), 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-12-14 23:54:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2021-12-14 23:54:47,055 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2021-12-14 23:54:47,055 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2021-12-14 23:54:47,055 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-14 23:54:47,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 66 transitions. [2021-12-14 23:54:47,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-14 23:54:47,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:47,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:47,055 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:47,056 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:47,056 INFO L791 eck$LassoCheckResult]: Stem: 2767#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2768#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2782#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2773#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 2763#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2764#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2765#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2766#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2803#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2800#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2799#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2794#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2795#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2783#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2784#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2798#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2804#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2802#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2801#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2796#L517-4 lis_~i~0#1 := 1; 2797#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2807#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2811#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2806#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2775#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2787#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2778#L519-2 [2021-12-14 23:54:47,056 INFO L793 eck$LassoCheckResult]: Loop: 2778#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2779#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2769#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2770#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2790#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2809#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2808#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2778#L519-2 [2021-12-14 23:54:47,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:47,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 2 times [2021-12-14 23:54:47,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:47,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020146997] [2021-12-14 23:54:47,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:47,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:47,088 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:47,122 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:47,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:47,122 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 7 times [2021-12-14 23:54:47,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:47,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927318761] [2021-12-14 23:54:47,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:47,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:47,127 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:47,131 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:47,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:47,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1635630457, now seen corresponding path program 1 times [2021-12-14 23:54:47,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:47,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943809602] [2021-12-14 23:54:47,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:47,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-14 23:54:47,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:54:47,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943809602] [2021-12-14 23:54:47,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943809602] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:54:47,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34736340] [2021-12-14 23:54:47,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:47,170 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:54:47,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:47,172 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:54:47,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2021-12-14 23:54:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:47,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 23:54:47,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-14 23:54:47,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:54:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-14 23:54:47,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34736340] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:54:47,390 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:54:47,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2021-12-14 23:54:47,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407134662] [2021-12-14 23:54:47,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:54:47,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:54:47,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 23:54:47,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-14 23:54:47,520 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. cyclomatic complexity: 19 Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 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-12-14 23:54:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:54:47,584 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2021-12-14 23:54:47,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 23:54:47,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 90 transitions. [2021-12-14 23:54:47,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2021-12-14 23:54:47,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 45 states and 56 transitions. [2021-12-14 23:54:47,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-12-14 23:54:47,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-12-14 23:54:47,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2021-12-14 23:54:47,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:54:47,586 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2021-12-14 23:54:47,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2021-12-14 23:54:47,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2021-12-14 23:54:47,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 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-12-14 23:54:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2021-12-14 23:54:47,587 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-12-14 23:54:47,587 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-12-14 23:54:47,587 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-14 23:54:47,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2021-12-14 23:54:47,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-12-14 23:54:47,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:47,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:47,587 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:47,587 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2021-12-14 23:54:47,588 INFO L791 eck$LassoCheckResult]: Stem: 3098#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3099#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3107#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3102#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 3094#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3095#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3096#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3097#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3123#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3122#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3121#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3114#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 3115#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3108#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3109#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3117#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3120#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3119#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3118#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 3116#L517-4 lis_~i~0#1 := 1; 3111#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3112#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3133#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 3131#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3130#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3124#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3105#L519-2 [2021-12-14 23:54:47,588 INFO L793 eck$LassoCheckResult]: Loop: 3105#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 3106#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3129#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3128#L521 assume !lis_#t~short11#1; 3126#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3110#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3100#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3101#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 3113#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3104#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3125#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3105#L519-2 [2021-12-14 23:54:47,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:47,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 3 times [2021-12-14 23:54:47,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:47,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020912146] [2021-12-14 23:54:47,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:47,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:47,615 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:47,635 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:47,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:47,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1752792449, now seen corresponding path program 1 times [2021-12-14 23:54:47,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:47,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206636322] [2021-12-14 23:54:47,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:47,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:47,641 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:47,645 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:47,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:47,645 INFO L85 PathProgramCache]: Analyzing trace with hash 116956416, now seen corresponding path program 1 times [2021-12-14 23:54:47,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:47,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693940423] [2021-12-14 23:54:47,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:47,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:48,073 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 23:54:48,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:54:48,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693940423] [2021-12-14 23:54:48,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693940423] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:54:48,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150593957] [2021-12-14 23:54:48,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:48,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:54:48,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:48,075 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:54:48,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2021-12-14 23:54:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:48,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-14 23:54:48,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:48,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-14 23:54:48,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-12-14 23:54:48,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 23:54:48,308 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-14 23:54:48,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-12-14 23:54:48,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-12-14 23:54:48,491 INFO L354 Elim1Store]: treesize reduction 172, result has 20.4 percent of original size [2021-12-14 23:54:48,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 74 [2021-12-14 23:54:48,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2021-12-14 23:54:48,704 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-14 23:54:48,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2021-12-14 23:54:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 23:54:48,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:54:48,936 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_lis_~j~0#1| Int)) (or (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (<= (+ (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |ULTIMATE.start_lis_~j~0#1| 4))) 1) (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4))))) (forall ((v_ArrVal_854 (Array Int Int))) (let ((.cse2 (* |c_ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (store .cse3 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) (+ (select .cse3 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |ULTIMATE.start_lis_~j~0#1| 4))) 1)))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_854) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 4)) (+ (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) 1))))))) is different from false [2021-12-14 23:54:48,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_854 (Array Int Int)) (|ULTIMATE.start_lis_~j~0#1| Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse3 (+ (select .cse2 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |ULTIMATE.start_lis_~j~0#1| 4))) 1)) (.cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4))) (or (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse2 .cse1 .cse3)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_854) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 .cse1) 1))) (<= .cse3 (select .cse2 .cse1)))))) is different from false [2021-12-14 23:54:49,047 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (|ULTIMATE.start_lis_~j~0#1| Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_849))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse2 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (.cse0 (+ (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |ULTIMATE.start_lis_~j~0#1| 4))) 1))) (or (<= .cse0 (select .cse1 .cse2)) (let ((.cse3 (select (store (store .cse4 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse1 .cse2 .cse0)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_854) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse3 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse3 .cse2) 1)))))))) is different from false [2021-12-14 23:54:49,057 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:54:49,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 451 treesize of output 271 [2021-12-14 23:54:49,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 424 treesize of output 412 [2021-12-14 23:54:49,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:54:49,070 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:54:49,082 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:54:49,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 320 treesize of output 308 [2021-12-14 23:54:49,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:54:49,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 253 [2021-12-14 23:54:49,095 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:54:49,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:54:49,107 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:54:49,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 370 treesize of output 358 [2021-12-14 23:54:49,113 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:54:49,116 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:54:49,137 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:54:49,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 282 treesize of output 308 [2021-12-14 23:54:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2021-12-14 23:54:49,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150593957] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:54:49,719 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:54:49,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 42 [2021-12-14 23:54:49,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973745239] [2021-12-14 23:54:49,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:54:49,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:54:49,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-14 23:54:49,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1328, Unknown=4, NotChecked=228, Total=1722 [2021-12-14 23:54:49,879 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 42 states have internal predecessors, (83), 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-12-14 23:54:54,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:54:54,359 INFO L93 Difference]: Finished difference Result 222 states and 284 transitions. [2021-12-14 23:54:54,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2021-12-14 23:54:54,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 284 transitions. [2021-12-14 23:54:54,360 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 94 [2021-12-14 23:54:54,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 284 transitions. [2021-12-14 23:54:54,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 206 [2021-12-14 23:54:54,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 206 [2021-12-14 23:54:54,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 284 transitions. [2021-12-14 23:54:54,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:54:54,362 INFO L681 BuchiCegarLoop]: Abstraction has 222 states and 284 transitions. [2021-12-14 23:54:54,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 284 transitions. [2021-12-14 23:54:54,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 146. [2021-12-14 23:54:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 146 states have (on average 1.2945205479452055) internal successors, (189), 145 states have internal predecessors, (189), 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-12-14 23:54:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2021-12-14 23:54:54,365 INFO L704 BuchiCegarLoop]: Abstraction has 146 states and 189 transitions. [2021-12-14 23:54:54,365 INFO L587 BuchiCegarLoop]: Abstraction has 146 states and 189 transitions. [2021-12-14 23:54:54,365 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-12-14 23:54:54,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 189 transitions. [2021-12-14 23:54:54,365 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 49 [2021-12-14 23:54:54,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:54,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:54,367 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:54,367 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2021-12-14 23:54:54,369 INFO L791 eck$LassoCheckResult]: Stem: 3818#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3819#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3828#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3822#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 3814#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3815#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3816#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3817#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3827#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3844#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3843#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3836#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 3837#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3840#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3847#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3848#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3841#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3842#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3890#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 3889#L517-4 lis_~i~0#1 := 1; 3887#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3885#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3882#L521 assume !lis_#t~short11#1; 3883#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3880#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3923#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3932#L519-2 [2021-12-14 23:54:54,369 INFO L793 eck$LassoCheckResult]: Loop: 3932#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 3832#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3833#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3954#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 3953#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3863#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3922#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3918#L521 assume !lis_#t~short11#1; 3920#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3934#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3933#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3932#L519-2 [2021-12-14 23:54:54,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:54,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1035361376, now seen corresponding path program 1 times [2021-12-14 23:54:54,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:54,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556710028] [2021-12-14 23:54:54,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:54,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:54,400 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:54,415 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:54,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:54,415 INFO L85 PathProgramCache]: Analyzing trace with hash -943386241, now seen corresponding path program 2 times [2021-12-14 23:54:54,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:54,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142383751] [2021-12-14 23:54:54,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:54,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:54,420 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:54,425 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:54,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:54,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1364618304, now seen corresponding path program 1 times [2021-12-14 23:54:54,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:54,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381548982] [2021-12-14 23:54:54,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:54,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 23:54:54,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:54:54,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381548982] [2021-12-14 23:54:54,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381548982] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:54:54,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065263329] [2021-12-14 23:54:54,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:54,708 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:54:54,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:54,736 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:54:54,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2021-12-14 23:54:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:54,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-14 23:54:54,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:54,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-14 23:54:54,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-12-14 23:54:54,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 23:54:54,926 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-12-14 23:54:54,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2021-12-14 23:54:54,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-12-14 23:54:54,963 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 23:54:54,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-12-14 23:54:54,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-14 23:54:55,120 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 23:54:55,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2021-12-14 23:54:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 23:54:55,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:54:55,234 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_957) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2021-12-14 23:54:55,255 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_957) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2021-12-14 23:54:55,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_955 Int)) (let ((.cse0 (select (store (let ((.cse2 (* |c_ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) v_ArrVal_955)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_953))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 4) 1)))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_957) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2021-12-14 23:54:55,267 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_955 Int)) (let ((.cse0 (select (store (let ((.cse2 (* |c_ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 4) v_ArrVal_955)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_953))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 8) 1)))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_957) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2021-12-14 23:54:55,275 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:54:55,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 148 [2021-12-14 23:54:55,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 263 [2021-12-14 23:54:55,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:54:55,299 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:54:55,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 500 treesize of output 496 [2021-12-14 23:54:55,314 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 23:54:55,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 402 treesize of output 378 [2021-12-14 23:54:55,326 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 23:54:55,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 504 treesize of output 480 [2021-12-14 23:54:55,342 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 23:54:55,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 889 treesize of output 841 [2021-12-14 23:54:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 8 not checked. [2021-12-14 23:54:55,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065263329] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:54:55,567 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:54:55,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 12] total 33 [2021-12-14 23:54:55,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415339417] [2021-12-14 23:54:55,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:54:55,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:54:55,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-14 23:54:55,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=721, Unknown=4, NotChecked=228, Total=1056 [2021-12-14 23:54:55,741 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. cyclomatic complexity: 49 Second operand has 33 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 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-12-14 23:54:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:54:56,833 INFO L93 Difference]: Finished difference Result 224 states and 290 transitions. [2021-12-14 23:54:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-14 23:54:56,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 290 transitions. [2021-12-14 23:54:56,840 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 110 [2021-12-14 23:54:56,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 224 states and 290 transitions. [2021-12-14 23:54:56,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 208 [2021-12-14 23:54:56,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 208 [2021-12-14 23:54:56,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 290 transitions. [2021-12-14 23:54:56,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:54:56,842 INFO L681 BuchiCegarLoop]: Abstraction has 224 states and 290 transitions. [2021-12-14 23:54:56,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 290 transitions. [2021-12-14 23:54:56,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 169. [2021-12-14 23:54:56,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 169 states have (on average 1.2840236686390532) internal successors, (217), 168 states have internal predecessors, (217), 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-12-14 23:54:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 217 transitions. [2021-12-14 23:54:56,846 INFO L704 BuchiCegarLoop]: Abstraction has 169 states and 217 transitions. [2021-12-14 23:54:56,846 INFO L587 BuchiCegarLoop]: Abstraction has 169 states and 217 transitions. [2021-12-14 23:54:56,846 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-12-14 23:54:56,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 217 transitions. [2021-12-14 23:54:56,847 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 65 [2021-12-14 23:54:56,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:56,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:56,847 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:56,847 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2021-12-14 23:54:56,847 INFO L791 eck$LassoCheckResult]: Stem: 4511#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4512#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 4521#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4515#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 4507#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4508#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4509#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4510#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4518#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4534#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4533#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4528#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 4529#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4531#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4537#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4538#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4532#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4522#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4523#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4536#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4581#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 4577#L517-4 lis_~i~0#1 := 1; 4578#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4573#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4574#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4567#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4568#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4641#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4637#L519-2 [2021-12-14 23:54:56,848 INFO L793 eck$LassoCheckResult]: Loop: 4637#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 4638#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4633#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4634#L521 assume !lis_#t~short11#1; 4653#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4556#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4651#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4648#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4646#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4645#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4650#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4637#L519-2 [2021-12-14 23:54:56,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:56,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1573720900, now seen corresponding path program 1 times [2021-12-14 23:54:56,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:56,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710237130] [2021-12-14 23:54:56,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:56,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:54:56,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:54:56,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710237130] [2021-12-14 23:54:56,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710237130] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:54:56,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090531039] [2021-12-14 23:54:56,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:56,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:54:56,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:56,932 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:54:56,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2021-12-14 23:54:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:57,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 23:54:57,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:54:57,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:54:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 23:54:57,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090531039] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:54:57,164 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:54:57,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-14 23:54:57,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411564983] [2021-12-14 23:54:57,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:54:57,165 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:54:57,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:57,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1752792449, now seen corresponding path program 3 times [2021-12-14 23:54:57,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:57,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794717582] [2021-12-14 23:54:57,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:57,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:57,183 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:54:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:54:57,187 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:54:57,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:54:57,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 23:54:57,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-12-14 23:54:57,358 INFO L87 Difference]: Start difference. First operand 169 states and 217 transitions. cyclomatic complexity: 55 Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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-12-14 23:54:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:54:57,488 INFO L93 Difference]: Finished difference Result 261 states and 330 transitions. [2021-12-14 23:54:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 23:54:57,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 261 states and 330 transitions. [2021-12-14 23:54:57,490 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 84 [2021-12-14 23:54:57,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 261 states to 255 states and 322 transitions. [2021-12-14 23:54:57,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2021-12-14 23:54:57,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 236 [2021-12-14 23:54:57,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 255 states and 322 transitions. [2021-12-14 23:54:57,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:54:57,496 INFO L681 BuchiCegarLoop]: Abstraction has 255 states and 322 transitions. [2021-12-14 23:54:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states and 322 transitions. [2021-12-14 23:54:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 229. [2021-12-14 23:54:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 229 states have (on average 1.2663755458515285) internal successors, (290), 228 states have internal predecessors, (290), 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-12-14 23:54:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 290 transitions. [2021-12-14 23:54:57,500 INFO L704 BuchiCegarLoop]: Abstraction has 229 states and 290 transitions. [2021-12-14 23:54:57,500 INFO L587 BuchiCegarLoop]: Abstraction has 229 states and 290 transitions. [2021-12-14 23:54:57,500 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-12-14 23:54:57,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 290 transitions. [2021-12-14 23:54:57,501 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 74 [2021-12-14 23:54:57,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:54:57,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:54:57,501 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:54:57,502 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2021-12-14 23:54:57,502 INFO L791 eck$LassoCheckResult]: Stem: 5133#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5134#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 5143#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5137#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 5129#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5130#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5164#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5140#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5131#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5132#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5161#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5160#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5159#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5152#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 5153#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5156#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5172#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5173#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5157#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5158#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5239#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5146#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5147#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 5244#L517-4 lis_~i~0#1 := 1; 5243#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5242#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5240#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5237#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5238#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5329#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5318#L519-2 [2021-12-14 23:54:57,502 INFO L793 eck$LassoCheckResult]: Loop: 5318#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 5325#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5324#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5323#L521 assume !lis_#t~short11#1; 5321#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5209#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5319#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5313#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5314#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5183#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5317#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5318#L519-2 [2021-12-14 23:54:57,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:54:57,502 INFO L85 PathProgramCache]: Analyzing trace with hash -11228634, now seen corresponding path program 2 times [2021-12-14 23:54:57,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:54:57,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061176332] [2021-12-14 23:54:57,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:54:57,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:54:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:54:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:54:57,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:54:57,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061176332] [2021-12-14 23:54:57,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061176332] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:54:57,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506831008] [2021-12-14 23:54:57,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:54:57,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:54:57,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:54:57,971 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:54:57,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2021-12-14 23:54:58,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:54:58,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:54:58,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-14 23:54:58,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:54:58,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-14 23:54:58,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-12-14 23:54:58,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 23:54:58,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:54:58,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2021-12-14 23:54:58,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2021-12-14 23:54:58,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:54:58,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:54:58,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:54:58,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2021-12-14 23:54:58,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-12-14 23:54:58,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:54:58,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:54:58,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:54:58,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:54:58,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:54:58,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:54:58,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-12-14 23:54:58,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-12-14 23:55:31,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:55:31,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:55:31,757 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:55:31,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 16 [2021-12-14 23:55:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 23:55:31,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:55:31,865 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1127 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) v_ArrVal_1127)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2021-12-14 23:55:31,876 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_190| Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_190| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (forall ((v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1127 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_190| 4)) v_ArrVal_1127)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))))) is different from false [2021-12-14 23:55:33,268 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_190| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1127 Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_190| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (let ((.cse0 (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1121))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_190| 4)) v_ArrVal_1127))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) is different from false [2021-12-14 23:55:33,299 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_191| Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_191| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_190| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1127 Int)) (or (let ((.cse0 (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_191| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1121))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_190| 4)) v_ArrVal_1127))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (< |v_ULTIMATE.start_lis_~i~0#1_190| (+ |v_ULTIMATE.start_lis_~i~0#1_191| 1)))))) is different from false [2021-12-14 23:55:33,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_190| Int) (|v_ULTIMATE.start_lis_~i~0#1_191| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1127 Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_191| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (let ((.cse0 (select (store (let ((.cse1 (store (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1119))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_191| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1121))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_190| 4)) v_ArrVal_1127))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (< |v_ULTIMATE.start_lis_~i~0#1_190| (+ |v_ULTIMATE.start_lis_~i~0#1_191| 1)))) is different from false [2021-12-14 23:55:33,348 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_190| Int) (|v_ULTIMATE.start_lis_~i~0#1_191| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1127 Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_190| (+ |v_ULTIMATE.start_lis_~i~0#1_191| 1)) (< |v_ULTIMATE.start_lis_~i~0#1_191| (+ |c_ULTIMATE.start_lis_~i~0#1| 2)) (let ((.cse0 (select (store (let ((.cse1 (store (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1119))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_191| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1121))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_190| 4)) v_ArrVal_1127))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) is different from false [2021-12-14 23:55:33,361 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:55:33,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 473 treesize of output 294 [2021-12-14 23:55:33,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 541 treesize of output 535 [2021-12-14 23:55:33,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:55:33,391 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:55:33,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 6432 treesize of output 6260 [2021-12-14 23:55:33,626 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 23:55:33,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3881 treesize of output 3833 [2021-12-14 23:55:33,648 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 23:55:33,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4085 treesize of output 4037 [2021-12-14 23:55:33,754 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 23:55:33,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5383 treesize of output 5287 [2021-12-14 23:55:33,869 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 23:55:33,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3338 treesize of output 3242 [2021-12-14 23:55:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 15 not checked. [2021-12-14 23:55:35,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506831008] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:55:35,765 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:55:35,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 13] total 41 [2021-12-14 23:55:35,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217734965] [2021-12-14 23:55:35,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:55:35,766 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:55:35,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:55:35,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1752792449, now seen corresponding path program 4 times [2021-12-14 23:55:35,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:55:35,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519245288] [2021-12-14 23:55:35,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:55:35,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:55:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:35,771 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:55:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:55:35,775 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:55:35,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:55:35,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-14 23:55:35,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1050, Unknown=7, NotChecked=426, Total=1640 [2021-12-14 23:55:35,944 INFO L87 Difference]: Start difference. First operand 229 states and 290 transitions. cyclomatic complexity: 70 Second operand has 41 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 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)