./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array17_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 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/termination-15/array17_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:04:47,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:04:47,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:04:47,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:04:47,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:04:47,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:04:47,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:04:47,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:04:47,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:04:47,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:04:47,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:04:47,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:04:47,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:04:47,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:04:47,839 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:04:47,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:04:47,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:04:47,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:04:47,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:04:47,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:04:47,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:04:47,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:04:47,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:04:47,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:04:47,867 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:04:47,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:04:47,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:04:47,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:04:47,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:04:47,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:04:47,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:04:47,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:04:47,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:04:47,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:04:47,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:04:47,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:04:47,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:04:47,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:04:47,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:04:47,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:04:47,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:04:47,876 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-15 17:04:47,902 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:04:47,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:04:47,903 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:04:47,903 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:04:47,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:04:47,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:04:47,904 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:04:47,904 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:04:47,905 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:04:47,905 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:04:47,905 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:04:47,906 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:04:47,906 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:04:47,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:04:47,906 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:04:47,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:04:47,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:04:47,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:04:47,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:04:47,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:04:47,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:04:47,907 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:04:47,907 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:04:47,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:04:47,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:04:47,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:04:47,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:04:47,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:04:47,909 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:04:47,910 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:04:47,910 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c [2021-12-15 17:04:48,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:04:48,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:04:48,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:04:48,113 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:04:48,127 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:04:48,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array17_alloca.i [2021-12-15 17:04:48,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6174d5af/f53f5d03f4e4462e8e66ca56658fdd6b/FLAG7123e05c6 [2021-12-15 17:04:48,509 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:04:48,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array17_alloca.i [2021-12-15 17:04:48,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6174d5af/f53f5d03f4e4462e8e66ca56658fdd6b/FLAG7123e05c6 [2021-12-15 17:04:48,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6174d5af/f53f5d03f4e4462e8e66ca56658fdd6b [2021-12-15 17:04:48,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:04:48,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:04:48,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:04:48,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:04:48,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:04:48,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:04:48" (1/1) ... [2021-12-15 17:04:48,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b10717a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:48, skipping insertion in model container [2021-12-15 17:04:48,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:04:48" (1/1) ... [2021-12-15 17:04:48,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:04:48,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:04:49,208 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:04:49,214 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:04:49,253 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:04:49,276 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:04:49,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:49 WrapperNode [2021-12-15 17:04:49,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:04:49,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:04:49,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:04:49,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:04:49,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:49" (1/1) ... [2021-12-15 17:04:49,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:49" (1/1) ... [2021-12-15 17:04:49,315 INFO L137 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2021-12-15 17:04:49,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:04:49,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:04:49,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:04:49,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:04:49,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:49" (1/1) ... [2021-12-15 17:04:49,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:49" (1/1) ... [2021-12-15 17:04:49,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:49" (1/1) ... [2021-12-15 17:04:49,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:49" (1/1) ... [2021-12-15 17:04:49,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:49" (1/1) ... [2021-12-15 17:04:49,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:49" (1/1) ... [2021-12-15 17:04:49,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:49" (1/1) ... [2021-12-15 17:04:49,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:04:49,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:04:49,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:04:49,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:04:49,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:49" (1/1) ... [2021-12-15 17:04:49,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:49,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:49,374 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-15 17:04:49,393 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-15 17:04:49,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:04:49,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:04:49,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 17:04:49,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:04:49,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:04:49,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:04:49,511 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:04:49,512 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:04:49,592 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:04:49,596 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:04:49,596 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 17:04:49,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:04:49 BoogieIcfgContainer [2021-12-15 17:04:49,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:04:49,598 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:04:49,598 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:04:49,600 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:04:49,601 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:04:49,601 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:04:48" (1/3) ... [2021-12-15 17:04:49,602 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34b0f091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:04:49, skipping insertion in model container [2021-12-15 17:04:49,602 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:04:49,602 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:49" (2/3) ... [2021-12-15 17:04:49,602 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34b0f091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:04:49, skipping insertion in model container [2021-12-15 17:04:49,603 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:04:49,603 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:04:49" (3/3) ... [2021-12-15 17:04:49,603 INFO L388 chiAutomizerObserver]: Analyzing ICFG array17_alloca.i [2021-12-15 17:04:49,629 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:04:49,629 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:04:49,630 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:04:49,630 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:04:49,630 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:04:49,630 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:04:49,630 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:04:49,630 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:04:49,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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-15 17:04:49,649 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-15 17:04:49,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:49,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:49,652 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:04:49,652 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:04:49,652 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:04:49,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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-15 17:04:49,654 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-15 17:04:49,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:49,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:49,660 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:04:49,660 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:04:49,665 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 14#L367true assume !(main_~length~0#1 < 1); 12#L367-2true assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 15#L371true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 17#L373true assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 5#L375-3true [2021-12-15 17:04:49,665 INFO L793 eck$LassoCheckResult]: Loop: 5#L375-3true assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 10#L375-2true main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5#L375-3true [2021-12-15 17:04:49,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:49,668 INFO L85 PathProgramCache]: Analyzing trace with hash 889572334, now seen corresponding path program 1 times [2021-12-15 17:04:49,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:49,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263645120] [2021-12-15 17:04:49,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:49,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:49,737 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:49,755 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:49,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:49,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2021-12-15 17:04:49,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:49,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952030503] [2021-12-15 17:04:49,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:49,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:49,768 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:49,776 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:49,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:49,777 INFO L85 PathProgramCache]: Analyzing trace with hash 180522064, now seen corresponding path program 1 times [2021-12-15 17:04:49,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:49,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615388468] [2021-12-15 17:04:49,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:49,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:49,801 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:49,816 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:50,059 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:04:50,059 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:04:50,059 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:04:50,059 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:04:50,059 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:04:50,060 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:50,060 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:04:50,060 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:04:50,060 INFO L133 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration1_Lasso [2021-12-15 17:04:50,060 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:04:50,060 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:04:50,075 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-15 17:04:50,079 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-15 17:04:50,082 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-15 17:04:50,084 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-15 17:04:50,086 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-15 17:04:50,087 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-15 17:04:50,089 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-15 17:04:50,091 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-15 17:04:50,092 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-15 17:04:50,095 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-15 17:04:50,098 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-15 17:04:50,100 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-15 17:04:50,177 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-15 17:04:50,344 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:04:50,347 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:04:50,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:50,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:50,350 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-15 17:04:50,375 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-15 17:04:50,376 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-15 17:04:50,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:50,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:50,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:50,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:50,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:50,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:50,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:50,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:50,416 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-15 17:04:50,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:50,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:50,418 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-15 17:04:50,422 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-15 17:04:50,424 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-15 17:04:50,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:50,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:50,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:50,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:50,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:50,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:50,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:50,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:50,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:50,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:50,479 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-15 17:04:50,480 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-15 17:04:50,481 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-15 17:04:50,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:50,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:50,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:50,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:50,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:50,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:50,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:50,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:50,520 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-15 17:04:50,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:50,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:50,521 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-15 17:04:50,522 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-15 17:04:50,523 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-15 17:04:50,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:50,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:50,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:50,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:50,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:50,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:50,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:50,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:50,562 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-15 17:04:50,562 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:50,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:50,564 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-15 17:04:50,564 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-15 17:04:50,566 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-15 17:04:50,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:50,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:50,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:50,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:50,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:50,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:50,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:50,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:50,604 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-15 17:04:50,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:50,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:50,606 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-15 17:04:50,606 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-15 17:04:50,608 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-15 17:04:50,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:50,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:50,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:50,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:50,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:50,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:50,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:50,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:50,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-12-15 17:04:50,631 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:50,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:50,632 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-15 17:04:50,633 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-15 17:04:50,634 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-15 17:04:50,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:50,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:50,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:50,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:50,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:50,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:50,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:50,656 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:50,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2021-12-15 17:04:50,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:50,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:50,672 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-15 17:04:50,673 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-15 17:04:50,674 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-15 17:04:50,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:50,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:50,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:50,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:50,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:50,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:50,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:50,682 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:50,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-12-15 17:04:50,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:50,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:50,699 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-15 17:04:50,700 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-15 17:04:50,701 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-15 17:04:50,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:50,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:50,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:50,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:50,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:50,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:50,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:50,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:50,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2021-12-15 17:04:50,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:50,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:50,739 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-15 17:04:50,740 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-15 17:04:50,741 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-15 17:04:50,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:50,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:50,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:50,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:50,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:50,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:50,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:50,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:50,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2021-12-15 17:04:50,772 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:50,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:50,772 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-15 17:04:50,773 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-15 17:04:50,775 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-15 17:04:50,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:50,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:50,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:50,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:50,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:50,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:50,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:50,815 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-15 17:04:50,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:50,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:50,817 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-15 17:04:50,818 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-15 17:04:50,821 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-15 17:04:50,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:50,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:50,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:50,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:50,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:50,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:50,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:50,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:50,858 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-15 17:04:50,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:50,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:50,860 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-15 17:04:50,860 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-15 17:04:50,862 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-15 17:04:50,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:50,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:50,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:50,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:50,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:50,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:50,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:50,898 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-15 17:04:50,898 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:50,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:50,899 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-15 17:04:50,901 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-15 17:04:50,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:50,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:50,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:50,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:50,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:50,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:50,914 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-15 17:04:50,914 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:50,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:50,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:50,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:50,931 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-15 17:04:50,932 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-15 17:04:50,934 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-15 17:04:50,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:50,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:50,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:50,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:50,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:50,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:50,978 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:04:51,024 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-12-15 17:04:51,024 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2021-12-15 17:04:51,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:51,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:51,026 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-15 17:04:51,060 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-15 17:04:51,060 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:04:51,080 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:04:51,080 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:04:51,081 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1) = -4*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 Supporting invariants [] [2021-12-15 17:04:51,099 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-15 17:04:51,105 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-12-15 17:04:51,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:51,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:04:51,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:51,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:04:51,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:51,189 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-15 17:04:51,216 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-15 17:04:51,217 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-15 17:04:51,243 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 34 states and 49 transitions. Complement of second has 7 states. [2021-12-15 17:04:51,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:04:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-15 17:04:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2021-12-15 17:04:51,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-15 17:04:51,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:51,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 8 letters. Loop has 2 letters. [2021-12-15 17:04:51,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:51,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 6 letters. Loop has 4 letters. [2021-12-15 17:04:51,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:51,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2021-12-15 17:04:51,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:51,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 12 states and 16 transitions. [2021-12-15 17:04:51,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-15 17:04:51,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:04:51,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2021-12-15 17:04:51,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:04:51,254 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-15 17:04:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2021-12-15 17:04:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-12-15 17:04:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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-15 17:04:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2021-12-15 17:04:51,269 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-15 17:04:51,269 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-15 17:04:51,269 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:04:51,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2021-12-15 17:04:51,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:51,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:51,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:51,272 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:04:51,272 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:04:51,272 INFO L791 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 122#L367 assume !(main_~length~0#1 < 1); 120#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 121#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 123#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 114#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 115#L375-4 main_~j~0#1 := 1; 112#L380-2 [2021-12-15 17:04:51,280 INFO L793 eck$LassoCheckResult]: Loop: 112#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 113#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 112#L380-2 [2021-12-15 17:04:51,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:51,291 INFO L85 PathProgramCache]: Analyzing trace with hash 180522006, now seen corresponding path program 1 times [2021-12-15 17:04:51,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:51,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660828862] [2021-12-15 17:04:51,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:51,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:51,301 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-15 17:04:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:51,361 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-15 17:04:51,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:04:51,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660828862] [2021-12-15 17:04:51,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660828862] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:04:51,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:04:51,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:04:51,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024201150] [2021-12-15 17:04:51,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:04:51,364 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:04:51,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:51,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 1 times [2021-12-15 17:04:51,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:51,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396690708] [2021-12-15 17:04:51,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:51,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:51,382 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:51,386 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:51,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:04:51,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 17:04:51,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 17:04:51,445 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-15 17:04:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:04:51,460 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2021-12-15 17:04:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 17:04:51,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2021-12-15 17:04:51,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:51,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2021-12-15 17:04:51,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:04:51,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:04:51,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2021-12-15 17:04:51,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:04:51,462 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2021-12-15 17:04:51,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2021-12-15 17:04:51,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2021-12-15 17:04:51,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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-15 17:04:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2021-12-15 17:04:51,463 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2021-12-15 17:04:51,463 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2021-12-15 17:04:51,464 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:04:51,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2021-12-15 17:04:51,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:51,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:51,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:51,464 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:04:51,465 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:04:51,465 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~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 154#L367 assume !(main_~length~0#1 < 1); 148#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 149#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 155#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 150#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 151#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 152#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 153#L375-4 main_~j~0#1 := 1; 144#L380-2 [2021-12-15 17:04:51,465 INFO L793 eck$LassoCheckResult]: Loop: 144#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 145#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 144#L380-2 [2021-12-15 17:04:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:51,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1683012600, now seen corresponding path program 1 times [2021-12-15 17:04:51,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:51,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456633314] [2021-12-15 17:04:51,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:51,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:51,473 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:51,480 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:51,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:51,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 2 times [2021-12-15 17:04:51,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:51,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057716682] [2021-12-15 17:04:51,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:51,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:51,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:51,487 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:51,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:51,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1827560517, now seen corresponding path program 1 times [2021-12-15 17:04:51,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:51,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921966895] [2021-12-15 17:04:51,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:51,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:51,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:04:51,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921966895] [2021-12-15 17:04:51,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921966895] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:04:51,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415052818] [2021-12-15 17:04:51,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:51,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:04:51,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:51,553 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:04:51,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-15 17:04:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:51,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 17:04:51,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:51,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:51,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:04:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:51,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415052818] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:04:51,641 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:04:51,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2021-12-15 17:04:51,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012223048] [2021-12-15 17:04:51,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:04:51,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:04:51,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 17:04:51,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-15 17:04:51,703 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 10 states, 10 states have (on average 2.0) 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-15 17:04:51,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:04:51,839 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2021-12-15 17:04:51,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 17:04:51,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 27 transitions. [2021-12-15 17:04:51,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:51,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 15 states and 17 transitions. [2021-12-15 17:04:51,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:04:51,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:04:51,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2021-12-15 17:04:51,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:04:51,845 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-15 17:04:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2021-12-15 17:04:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-12-15 17:04:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 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-15 17:04:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-12-15 17:04:51,847 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-15 17:04:51,847 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-15 17:04:51,847 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:04:51,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2021-12-15 17:04:51,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:51,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:51,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:51,849 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:04:51,849 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:04:51,850 INFO L791 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 277#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 280#L367 assume !(main_~length~0#1 < 1); 278#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 279#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 281#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 272#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 273#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 274#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 275#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 283#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 282#L375-4 main_~j~0#1 := 1; 270#L380-2 [2021-12-15 17:04:51,850 INFO L793 eck$LassoCheckResult]: Loop: 270#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 271#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 270#L380-2 [2021-12-15 17:04:51,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:51,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1827505318, now seen corresponding path program 2 times [2021-12-15 17:04:51,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:51,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726756418] [2021-12-15 17:04:51,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:51,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:51,879 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:51,889 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:51,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:51,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 3 times [2021-12-15 17:04:51,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:51,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250102958] [2021-12-15 17:04:51,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:51,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:51,906 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:51,910 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:51,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:51,910 INFO L85 PathProgramCache]: Analyzing trace with hash 409014941, now seen corresponding path program 2 times [2021-12-15 17:04:51,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:51,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513296814] [2021-12-15 17:04:51,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:51,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:51,924 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:51,934 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:52,170 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:04:52,170 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:04:52,170 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:04:52,170 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:04:52,170 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:04:52,170 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:52,170 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:04:52,170 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:04:52,170 INFO L133 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration4_Lasso [2021-12-15 17:04:52,170 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:04:52,170 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:04:52,172 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-15 17:04:52,174 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-15 17:04:52,176 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-15 17:04:52,177 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-15 17:04:52,179 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-15 17:04:52,181 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-15 17:04:52,183 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-15 17:04:52,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:04:52,308 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-15 17:04:52,310 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-15 17:04:52,311 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-15 17:04:52,313 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-15 17:04:52,485 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:04:52,485 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:04:52,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:52,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:52,486 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-15 17:04:52,487 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-15 17:04:52,490 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-15 17:04:52,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:52,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:52,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:52,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:52,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:52,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:52,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:52,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:52,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-12-15 17:04:52,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:52,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:52,556 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-15 17:04:52,561 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-15 17:04:52,561 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-15 17:04:52,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:52,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:52,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:52,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:52,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:52,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:52,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:52,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:52,583 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-15 17:04:52,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:52,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:52,585 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-15 17:04:52,586 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-15 17:04:52,587 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-15 17:04:52,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:52,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:52,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:52,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:52,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:52,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:52,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:52,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:52,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2021-12-15 17:04:52,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:52,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:52,610 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-15 17:04:52,611 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-15 17:04:52,613 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-15 17:04:52,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:52,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:52,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:52,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:52,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:52,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:52,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:52,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-15 17:04:52,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:52,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:52,652 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-15 17:04:52,652 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-15 17:04:52,655 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-15 17:04:52,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:52,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:52,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:52,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:52,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:52,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:52,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:52,669 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:52,683 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-15 17:04:52,684 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:52,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:52,685 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-15 17:04:52,693 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-15 17:04:52,693 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-15 17:04:52,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:52,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:52,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:52,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:52,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:52,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:52,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:52,714 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:52,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-15 17:04:52,729 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:52,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:52,730 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-15 17:04:52,731 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-15 17:04:52,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-15 17:04:52,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:52,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:52,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:52,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:52,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:52,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:52,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:52,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-15 17:04:52,772 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:52,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:52,773 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-15 17:04:52,774 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-15 17:04:52,776 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-15 17:04:52,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:52,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:52,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:52,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:52,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:52,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:52,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:52,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:52,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:52,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:52,852 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-15 17:04:52,852 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-15 17:04:52,854 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-15 17:04:52,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:52,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:52,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:52,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:52,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:52,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:52,879 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:04:52,916 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2021-12-15 17:04:52,916 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2021-12-15 17:04:52,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:52,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:52,918 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-15 17:04:52,980 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-15 17:04:52,980 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:04:53,003 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:04:53,003 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:04:53,004 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2021-12-15 17:04:53,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:53,042 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2021-12-15 17:04:53,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:53,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:04:53,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:53,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:04:53,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:53,100 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-15 17:04:53,100 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-15 17:04:53,101 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-15 17:04:53,107 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 18 states and 22 transitions. Complement of second has 5 states. [2021-12-15 17:04:53,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-15 17:04:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-15 17:04:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2021-12-15 17:04:53,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 2 letters. [2021-12-15 17:04:53,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:53,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2021-12-15 17:04:53,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:53,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 4 letters. [2021-12-15 17:04:53,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:53,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2021-12-15 17:04:53,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:53,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2021-12-15 17:04:53,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-15 17:04:53,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-15 17:04:53,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2021-12-15 17:04:53,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:04:53,110 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-15 17:04:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2021-12-15 17:04:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-15 17:04:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 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-15 17:04:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-15 17:04:53,111 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-15 17:04:53,111 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-15 17:04:53,111 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:04:53,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2021-12-15 17:04:53,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:53,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:53,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:53,112 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:04:53,112 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:04:53,113 INFO L791 eck$LassoCheckResult]: Stem: 394#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 395#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 402#L367 assume !(main_~length~0#1 < 1); 396#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 397#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 403#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 398#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 399#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 400#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 401#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 406#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 404#L375-4 main_~j~0#1 := 1; 405#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 393#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 389#L380-2 [2021-12-15 17:04:53,113 INFO L793 eck$LassoCheckResult]: Loop: 389#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 390#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 389#L380-2 [2021-12-15 17:04:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:53,113 INFO L85 PathProgramCache]: Analyzing trace with hash 409014943, now seen corresponding path program 1 times [2021-12-15 17:04:53,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:53,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826258198] [2021-12-15 17:04:53,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:53,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:53,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:53,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:04:53,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826258198] [2021-12-15 17:04:53,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826258198] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:04:53,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745712269] [2021-12-15 17:04:53,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:53,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:04:53,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:53,294 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:04:53,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-12-15 17:04:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:53,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 17:04:53,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:53,381 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-15 17:04:53,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:53,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:04:53,433 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 24 [2021-12-15 17:04:53,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 17:04:53,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:04:53,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:04:53,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 17:04:53,538 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:04:53,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 34 treesize of output 18 [2021-12-15 17:04:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:53,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:04:54,088 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int) (v_ArrVal_60 Int)) (or (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) v_ArrVal_60)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_56| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (< 1 |v_ULTIMATE.start_main_~j~0#1_56|) (< v_ArrVal_60 |c_ULTIMATE.start_main_~value~0#1|) (<= |v_ULTIMATE.start_main_~j~0#1_56| 0))) is different from false [2021-12-15 17:04:54,549 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int) (v_ArrVal_60 Int)) (or (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~arr~0#1.offset| 4) v_ArrVal_60)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_56| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (< 1 |v_ULTIMATE.start_main_~j~0#1_56|) (< v_ArrVal_60 |c_ULTIMATE.start_main_~value~0#1|) (<= |v_ULTIMATE.start_main_~j~0#1_56| 0))) is different from false [2021-12-15 17:04:54,569 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 52 treesize of output 48 [2021-12-15 17:04:54,582 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-12-15 17:04:54,582 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 944 treesize of output 840 [2021-12-15 17:04:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-15 17:04:54,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745712269] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:04:54,693 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:04:54,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 16 [2021-12-15 17:04:54,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764306587] [2021-12-15 17:04:54,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:04:54,694 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:04:54,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:54,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 4 times [2021-12-15 17:04:54,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:54,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252319701] [2021-12-15 17:04:54,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:54,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:54,698 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:54,701 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:54,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:04:54,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 17:04:54,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2021-12-15 17:04:54,742 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 17 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-15 17:04:55,188 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int) (v_ArrVal_60 Int)) (or (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~arr~0#1.offset| 4) v_ArrVal_60)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_56| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (< 1 |v_ULTIMATE.start_main_~j~0#1_56|) (< v_ArrVal_60 |c_ULTIMATE.start_main_~value~0#1|) (<= |v_ULTIMATE.start_main_~j~0#1_56| 0))) (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|)) 1) |c_ULTIMATE.start_main_~value~0#1|) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2021-12-15 17:04:55,621 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int) (v_ArrVal_60 Int)) (or (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) v_ArrVal_60)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_56| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (< 1 |v_ULTIMATE.start_main_~j~0#1_56|) (< v_ArrVal_60 |c_ULTIMATE.start_main_~value~0#1|) (<= |v_ULTIMATE.start_main_~j~0#1_56| 0))) (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) 0) 1) |c_ULTIMATE.start_main_~value~0#1|) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2021-12-15 17:04:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:04:55,659 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2021-12-15 17:04:55,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 17:04:55,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2021-12-15 17:04:55,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-15 17:04:55,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 35 transitions. [2021-12-15 17:04:55,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-15 17:04:55,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-15 17:04:55,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2021-12-15 17:04:55,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:04:55,662 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-15 17:04:55,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2021-12-15 17:04:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2021-12-15 17:04:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 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-15 17:04:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-12-15 17:04:55,663 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-15 17:04:55,663 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-15 17:04:55,663 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:04:55,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2021-12-15 17:04:55,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:55,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:55,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:55,664 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:04:55,664 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:04:55,664 INFO L791 eck$LassoCheckResult]: Stem: 549#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 550#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 553#L367 assume !(main_~length~0#1 < 1); 551#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 552#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 554#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 545#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 546#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 547#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 548#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 561#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 560#L375-4 main_~j~0#1 := 1; 559#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 543#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 542#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 544#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 540#L380-2 [2021-12-15 17:04:55,664 INFO L793 eck$LassoCheckResult]: Loop: 540#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 541#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 540#L380-2 [2021-12-15 17:04:55,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:55,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2073631454, now seen corresponding path program 1 times [2021-12-15 17:04:55,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:55,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938209961] [2021-12-15 17:04:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:55,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:55,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:04:55,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938209961] [2021-12-15 17:04:55,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938209961] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:04:55,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859996535] [2021-12-15 17:04:55,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:55,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:04:55,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:55,772 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:04:55,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-12-15 17:04:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:55,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 17:04:55,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:55,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:04:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:55,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859996535] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:04:55,908 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:04:55,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2021-12-15 17:04:55,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933390104] [2021-12-15 17:04:55,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:04:55,909 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:04:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:55,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 5 times [2021-12-15 17:04:55,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:55,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566402443] [2021-12-15 17:04:55,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:55,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:55,912 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:55,915 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:55,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:04:55,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 17:04:55,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-12-15 17:04:55,968 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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-15 17:04:56,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:04:56,051 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2021-12-15 17:04:56,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 17:04:56,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2021-12-15 17:04:56,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:56,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 25 transitions. [2021-12-15 17:04:56,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-15 17:04:56,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-15 17:04:56,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2021-12-15 17:04:56,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:04:56,052 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-15 17:04:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2021-12-15 17:04:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-12-15 17:04:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 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-15 17:04:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-12-15 17:04:56,054 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-12-15 17:04:56,054 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-12-15 17:04:56,054 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:04:56,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2021-12-15 17:04:56,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:56,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:56,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:56,055 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:04:56,055 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:04:56,055 INFO L791 eck$LassoCheckResult]: Stem: 708#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 709#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 716#L367 assume !(main_~length~0#1 < 1); 710#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 711#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 717#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 712#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 713#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 714#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 715#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 722#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 721#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 720#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 718#L375-4 main_~j~0#1 := 1; 719#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 706#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 703#L380-2 [2021-12-15 17:04:56,055 INFO L793 eck$LassoCheckResult]: Loop: 703#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 704#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 703#L380-2 [2021-12-15 17:04:56,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:56,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2020585215, now seen corresponding path program 2 times [2021-12-15 17:04:56,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:56,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202749524] [2021-12-15 17:04:56,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:56,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:56,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:04:56,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202749524] [2021-12-15 17:04:56,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202749524] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:04:56,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71776239] [2021-12-15 17:04:56,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:04:56,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:04:56,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:56,223 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:04:56,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-12-15 17:04:56,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:04:56,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:04:56,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-15 17:04:56,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:56,283 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-15 17:04:56,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:04:56,308 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 24 [2021-12-15 17:04:56,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:04:56,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:04:56,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:04:56,364 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:04:56,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2021-12-15 17:04:56,421 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 17:04:56,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:04:56,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:04:56,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 17:04:56,428 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:04:56,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 34 treesize of output 18 [2021-12-15 17:04:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:56,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:04:56,937 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (<= |v_ULTIMATE.start_main_~j~0#1_66| 0) (< 1 |v_ULTIMATE.start_main_~j~0#1_66|) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))))) is different from false [2021-12-15 17:05:08,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_47| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_47| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (<= |v_ULTIMATE.start_main_~j~0#1_66| 0) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_47| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (< 1 |v_ULTIMATE.start_main_~j~0#1_66|))))) is different from false [2021-12-15 17:05:09,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (<= |v_ULTIMATE.start_main_~j~0#1_66| 0) (< |v_ULTIMATE.start_main_~i~0#1_47| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~i~0#1_47| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (< 1 |v_ULTIMATE.start_main_~j~0#1_66|) (< v_ArrVal_92 |c_ULTIMATE.start_main_~value~0#1|))) is different from false [2021-12-15 17:05:10,466 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (<= |v_ULTIMATE.start_main_~j~0#1_66| 0) (< 1 |v_ULTIMATE.start_main_~j~0#1_66|) (< v_ArrVal_92 |c_ULTIMATE.start_main_~value~0#1|) (< |v_ULTIMATE.start_main_~i~0#1_47| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~arr~0#1.offset| 4) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~i~0#1_47| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))))) is different from false [2021-12-15 17:05:10,481 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 66 treesize of output 62 [2021-12-15 17:05:10,491 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-12-15 17:05:10,492 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 12142 treesize of output 11422 [2021-12-15 17:05:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-12-15 17:05:11,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71776239] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:05:11,922 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:05:11,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 20 [2021-12-15 17:05:11,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955821031] [2021-12-15 17:05:11,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:05:11,923 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:05:11,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:11,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 6 times [2021-12-15 17:05:11,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:11,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818599722] [2021-12-15 17:05:11,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:11,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:11,929 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:05:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:11,933 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:05:11,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:05:11,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-15 17:05:11,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=217, Unknown=4, NotChecked=132, Total=420 [2021-12-15 17:05:11,985 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 7 Second operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 21 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-15 17:05:12,609 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (<= |v_ULTIMATE.start_main_~j~0#1_66| 0) (< 1 |v_ULTIMATE.start_main_~j~0#1_66|) (< v_ArrVal_92 |c_ULTIMATE.start_main_~value~0#1|) (< |v_ULTIMATE.start_main_~i~0#1_47| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~arr~0#1.offset| 4) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~i~0#1_47| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))))) (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|)) 1) |c_ULTIMATE.start_main_~value~0#1|) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2021-12-15 17:05:13,245 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) 0) 1) |c_ULTIMATE.start_main_~value~0#1|) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (<= |v_ULTIMATE.start_main_~j~0#1_66| 0) (< |v_ULTIMATE.start_main_~i~0#1_47| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~i~0#1_47| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (< 1 |v_ULTIMATE.start_main_~j~0#1_66|) (< v_ArrVal_92 |c_ULTIMATE.start_main_~value~0#1|))) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2021-12-15 17:05:25,249 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_47| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_47| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (<= |v_ULTIMATE.start_main_~j~0#1_66| 0) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_47| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (< 1 |v_ULTIMATE.start_main_~j~0#1_66|))))) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|))) (<= (+ (select .cse2 0) 1) (select .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2021-12-15 17:05:25,682 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~i~0#1_45| Int)) (and (<= (+ |v_ULTIMATE.start_main_~i~0#1_45| 1) |c_ULTIMATE.start_main_~i~0#1|) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|))) (<= (+ (select .cse0 0) 1) (select .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_45| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (<= 1 |v_ULTIMATE.start_main_~i~0#1_45|) (<= |v_ULTIMATE.start_main_~i~0#1_45| 1))) (forall ((|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (<= |v_ULTIMATE.start_main_~j~0#1_66| 0) (< 1 |v_ULTIMATE.start_main_~j~0#1_66|) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) v_ArrVal_94)) (.cse2 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~arr~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2021-12-15 17:05:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:05:25,721 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2021-12-15 17:05:25,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 17:05:25,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2021-12-15 17:05:25,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-15 17:05:25,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 37 transitions. [2021-12-15 17:05:25,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-15 17:05:25,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-15 17:05:25,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2021-12-15 17:05:25,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:05:25,723 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-12-15 17:05:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2021-12-15 17:05:25,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2021-12-15 17:05:25,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 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-15 17:05:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2021-12-15 17:05:25,725 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-12-15 17:05:25,725 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-12-15 17:05:25,725 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:05:25,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2021-12-15 17:05:25,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:05:25,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:05:25,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:05:25,726 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:05:25,726 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:05:25,726 INFO L791 eck$LassoCheckResult]: Stem: 883#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 884#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 891#L367 assume !(main_~length~0#1 < 1); 885#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 886#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 892#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 887#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 888#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 889#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 890#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 895#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 898#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 901#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 900#L375-4 main_~j~0#1 := 1; 899#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 882#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 880#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 881#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 878#L380-2 [2021-12-15 17:05:25,726 INFO L793 eck$LassoCheckResult]: Loop: 878#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 879#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 878#L380-2 [2021-12-15 17:05:25,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:25,727 INFO L85 PathProgramCache]: Analyzing trace with hash -457174268, now seen corresponding path program 2 times [2021-12-15 17:05:25,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:25,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771282145] [2021-12-15 17:05:25,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:25,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:05:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:05:25,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:05:25,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771282145] [2021-12-15 17:05:25,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771282145] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:05:25,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928270509] [2021-12-15 17:05:25,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:05:25,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:05:25,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:25,873 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:05:25,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-12-15 17:05:25,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:05:25,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:05:25,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 17:05:25,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:05:25,934 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-15 17:05:25,958 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-15 17:05:25,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-12-15 17:05:26,044 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 17:05:26,044 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 36 treesize of output 12 [2021-12-15 17:05:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:05:26,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:05:26,201 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 47 treesize of output 43 [2021-12-15 17:05:26,205 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 17:05:26,206 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 371 treesize of output 339 [2021-12-15 17:05:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:05:26,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928270509] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:05:26,250 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:05:26,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2021-12-15 17:05:26,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467593] [2021-12-15 17:05:26,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:05:26,251 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:05:26,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:26,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 7 times [2021-12-15 17:05:26,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:26,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097723782] [2021-12-15 17:05:26,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:26,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:26,254 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:05:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:05:26,256 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:05:26,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:05:26,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 17:05:26,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-12-15 17:05:26,306 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 8 Second operand has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:05:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:05:26,411 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2021-12-15 17:05:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 17:05:26,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2021-12-15 17:05:26,412 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-12-15 17:05:26,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 51 transitions. [2021-12-15 17:05:26,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-12-15 17:05:26,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-12-15 17:05:26,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2021-12-15 17:05:26,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:05:26,414 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2021-12-15 17:05:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2021-12-15 17:05:26,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2021-12-15 17:05:26,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 34 states have internal predecessors, (43), 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-15 17:05:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2021-12-15 17:05:26,416 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2021-12-15 17:05:26,416 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2021-12-15 17:05:26,416 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:05:26,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2021-12-15 17:05:26,416 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-15 17:05:26,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:05:26,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:05:26,417 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:05:26,417 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:05:26,417 INFO L791 eck$LassoCheckResult]: Stem: 1076#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1077#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1086#L367 assume !(main_~length~0#1 < 1); 1078#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1079#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1087#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1080#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1081#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1082#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1083#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1090#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1093#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1101#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1102#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1106#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1105#L375-4 main_~j~0#1 := 1; 1104#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1103#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1100#L380-2 [2021-12-15 17:05:26,417 INFO L793 eck$LassoCheckResult]: Loop: 1100#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1099#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1100#L380-2 [2021-12-15 17:05:26,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:05:26,418 INFO L85 PathProgramCache]: Analyzing trace with hash -404128029, now seen corresponding path program 3 times [2021-12-15 17:05:26,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:05:26,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512158146] [2021-12-15 17:05:26,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:05:26,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:05:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:05:26,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:05:26,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:05:26,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512158146] [2021-12-15 17:05:26,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512158146] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:05:26,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422096698] [2021-12-15 17:05:26,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 17:05:26,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:05:26,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:05:26,584 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:05:26,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-12-15 17:05:26,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-15 17:05:26,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:05:26,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-15 17:05:26,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:05:26,667 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-15 17:05:26,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:05:26,701 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 29 [2021-12-15 17:05:26,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:05:26,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:05:26,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:05:26,741 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:05:26,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2021-12-15 17:05:26,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:05:26,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:05:26,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:05:26,773 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:05:26,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2021-12-15 17:05:26,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 17:05:26,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:05:26,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:05:26,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 17:05:26,824 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:05:26,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 39 treesize of output 18 [2021-12-15 17:05:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:05:26,832 INFO L328 TraceCheckSpWp]: Computing backward predicates...