./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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:08:28,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:08:28,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:08:28,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:08:28,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:08:28,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:08:28,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:08:28,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:08:28,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:08:28,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:08:28,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:08:28,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:08:28,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:08:28,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:08:28,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:08:28,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:08:28,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:08:28,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:08:28,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:08:28,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:08:28,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:08:28,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:08:28,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:08:28,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:08:28,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:08:28,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:08:28,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:08:28,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:08:28,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:08:28,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:08:28,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:08:28,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:08:28,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:08:28,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:08:28,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:08:28,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:08:28,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:08:28,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:08:28,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:08:28,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:08:28,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:08:28,725 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-14 23:08:28,744 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:08:28,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:08:28,745 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:08:28,745 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:08:28,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:08:28,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:08:28,747 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:08:28,747 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:08:28,747 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:08:28,748 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:08:28,748 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:08:28,748 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:08:28,749 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:08:28,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:08:28,749 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:08:28,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:08:28,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:08:28,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:08:28,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:08:28,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:08:28,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:08:28,750 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:08:28,750 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:08:28,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:08:28,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:08:28,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:08:28,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:08:28,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:08:28,751 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:08:28,752 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:08:28,752 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-14 23:08:28,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:08:28,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:08:28,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:08:28,930 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:08:28,931 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:08:28,931 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-14 23:08:28,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666f51a0b/50c6e3263aba4826a6defad8c7f32d88/FLAG1059bc911 [2021-12-14 23:08:29,335 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:08:29,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array17_alloca.i [2021-12-14 23:08:29,341 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666f51a0b/50c6e3263aba4826a6defad8c7f32d88/FLAG1059bc911 [2021-12-14 23:08:29,721 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666f51a0b/50c6e3263aba4826a6defad8c7f32d88 [2021-12-14 23:08:29,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:08:29,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:08:29,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:08:29,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:08:29,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:08:29,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:08:29" (1/1) ... [2021-12-14 23:08:29,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8efda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:08:29, skipping insertion in model container [2021-12-14 23:08:29,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:08:29" (1/1) ... [2021-12-14 23:08:29,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:08:29,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:08:30,004 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:08:30,010 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:08:30,056 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:08:30,077 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:08:30,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:08:30 WrapperNode [2021-12-14 23:08:30,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:08:30,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:08:30,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:08:30,079 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:08:30,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:08:30" (1/1) ... [2021-12-14 23:08:30,100 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:08:30" (1/1) ... [2021-12-14 23:08:30,117 INFO L137 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2021-12-14 23:08:30,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:08:30,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:08:30,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:08:30,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:08:30,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:08:30" (1/1) ... [2021-12-14 23:08:30,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:08:30" (1/1) ... [2021-12-14 23:08:30,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:08:30" (1/1) ... [2021-12-14 23:08:30,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:08:30" (1/1) ... [2021-12-14 23:08:30,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:08:30" (1/1) ... [2021-12-14 23:08:30,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:08:30" (1/1) ... [2021-12-14 23:08:30,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:08:30" (1/1) ... [2021-12-14 23:08:30,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:08:30,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:08:30,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:08:30,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:08:30,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:08:30" (1/1) ... [2021-12-14 23:08:30,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:30,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:30,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:30,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-14 23:08:30,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 23:08:30,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 23:08:30,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 23:08:30,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 23:08:30,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:08:30,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:08:30,249 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:08:30,250 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:08:30,330 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:08:30,333 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:08:30,334 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 23:08:30,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:08:30 BoogieIcfgContainer [2021-12-14 23:08:30,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:08:30,335 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:08:30,336 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:08:30,337 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:08:30,338 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:08:30,338 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:08:29" (1/3) ... [2021-12-14 23:08:30,339 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@370221ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:08:30, skipping insertion in model container [2021-12-14 23:08:30,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:08:30,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:08:30" (2/3) ... [2021-12-14 23:08:30,339 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@370221ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:08:30, skipping insertion in model container [2021-12-14 23:08:30,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:08:30,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:08:30" (3/3) ... [2021-12-14 23:08:30,341 INFO L388 chiAutomizerObserver]: Analyzing ICFG array17_alloca.i [2021-12-14 23:08:30,372 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:08:30,372 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:08:30,372 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:08:30,373 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:08:30,373 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:08:30,373 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:08:30,373 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:08:30,373 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:08:30,382 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-14 23:08:30,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-14 23:08:30,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:08:30,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:08:30,403 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-14 23:08:30,403 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:08:30,404 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:08:30,404 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-14 23:08:30,405 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-14 23:08:30,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:08:30,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:08:30,405 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-14 23:08:30,406 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:08:30,410 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-14 23:08:30,410 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-14 23:08:30,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:30,413 INFO L85 PathProgramCache]: Analyzing trace with hash 889572334, now seen corresponding path program 1 times [2021-12-14 23:08:30,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:30,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659626503] [2021-12-14 23:08:30,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:30,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:30,476 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:08:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:30,496 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:08:30,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:30,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2021-12-14 23:08:30,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:30,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444205286] [2021-12-14 23:08:30,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:30,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:30,509 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:08:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:30,516 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:08:30,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:30,517 INFO L85 PathProgramCache]: Analyzing trace with hash 180522064, now seen corresponding path program 1 times [2021-12-14 23:08:30,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:30,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949089904] [2021-12-14 23:08:30,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:30,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:30,535 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:08:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:30,550 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:08:30,769 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:08:30,769 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:08:30,769 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:08:30,770 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:08:30,770 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:08:30,770 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:30,770 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:08:30,770 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:08:30,770 INFO L133 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration1_Lasso [2021-12-14 23:08:30,770 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:08:30,771 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:08:30,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:30,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:30,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:30,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:30,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:30,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:30,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:30,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:30,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:30,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:30,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:30,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:30,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:31,072 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:08:31,074 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:08:31,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:31,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:31,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:31,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:31,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:31,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:08:31,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:31,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:31,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:31,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:08:31,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:08:31,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-14 23:08:31,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:31,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-14 23:08:31,128 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:31,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:31,129 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:31,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-14 23:08:31,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:31,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:31,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:31,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:31,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:31,145 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:08:31,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:08:31,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:31,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-14 23:08:31,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:31,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:31,189 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:31,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-14 23:08:31,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:31,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:31,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:08:31,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:31,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:31,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:31,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:08:31,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:08:31,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:31,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-14 23:08:31,232 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:31,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:31,233 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:31,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-14 23:08:31,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:31,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:31,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:08:31,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:31,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:31,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:31,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:08:31,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:08:31,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:31,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-12-14 23:08:31,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:31,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:31,266 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:31,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-14 23:08:31,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:31,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:31,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:08:31,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:31,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:31,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:31,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:08:31,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:08:31,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:31,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-14 23:08:31,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:31,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:31,315 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:31,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-14 23:08:31,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:31,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:31,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:08:31,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:31,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:31,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:31,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:08:31,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:08:31,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:31,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-14 23:08:31,355 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:31,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:31,356 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:31,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-14 23:08:31,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:31,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:31,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:08:31,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:31,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:31,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:31,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:08:31,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:08:31,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:31,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-14 23:08:31,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:31,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:31,386 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:31,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-14 23:08:31,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:31,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:31,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:08:31,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:31,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:31,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:31,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:08:31,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:08:31,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:31,419 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-14 23:08:31,419 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:31,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:31,420 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:31,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-14 23:08:31,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-14 23:08:31,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:31,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:08:31,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:31,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:31,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:31,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:08:31,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:08:31,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:31,460 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-14 23:08:31,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:31,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:31,461 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:31,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-14 23:08:31,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:31,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:31,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:08:31,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:31,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:31,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:31,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:08:31,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:08:31,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:31,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-14 23:08:31,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:31,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:31,493 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:31,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-14 23:08:31,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:31,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:31,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:31,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:31,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:31,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:08:31,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:08:31,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:31,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-14 23:08:31,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:31,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:31,552 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:31,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-14 23:08:31,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:31,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:31,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:08:31,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:31,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:31,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:31,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:08:31,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:08:31,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:31,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-12-14 23:08:31,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:31,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:31,583 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:31,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-14 23:08:31,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:31,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:31,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:31,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:31,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:31,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:08:31,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:08:31,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:31,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-14 23:08:31,626 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:31,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:31,627 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:31,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-14 23:08:31,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:31,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:31,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:31,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:31,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:31,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:08:31,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:08:31,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:31,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-12-14 23:08:31,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:31,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:31,667 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:31,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-14 23:08:31,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:31,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:31,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:31,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:31,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:31,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:08:31,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:08:31,698 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:08:31,725 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2021-12-14 23:08:31,725 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2021-12-14 23:08:31,726 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:31,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:31,727 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:31,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-14 23:08:31,792 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:08:31,812 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-14 23:08:31,812 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:08:31,813 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 1073741821*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [-1*ULTIMATE.start_main_~length~0#1 + 536870911 >= 0] [2021-12-14 23:08:31,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-14 23:08:31,860 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2021-12-14 23:08:31,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:08:31,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 23:08:31,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:08:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:08:31,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 23:08:31,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:08:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:08:31,985 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-14 23:08:31,986 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 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-14 23:08:32,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-14 23:08:32,043 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 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) Result 39 states and 54 transitions. Complement of second has 8 states. [2021-12-14 23:08:32,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-14 23:08:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. 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-14 23:08:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2021-12-14 23:08:32,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-14 23:08:32,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:08:32,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 8 letters. Loop has 2 letters. [2021-12-14 23:08:32,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:08:32,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 6 letters. Loop has 4 letters. [2021-12-14 23:08:32,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:08:32,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 54 transitions. [2021-12-14 23:08:32,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-14 23:08:32,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 13 states and 17 transitions. [2021-12-14 23:08:32,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-14 23:08:32,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-14 23:08:32,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2021-12-14 23:08:32,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:08:32,054 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2021-12-14 23:08:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2021-12-14 23:08:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2021-12-14 23:08:32,067 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-14 23:08:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2021-12-14 23:08:32,068 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-14 23:08:32,068 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-14 23:08:32,068 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:08:32,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2021-12-14 23:08:32,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-14 23:08:32,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:08:32,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:08:32,069 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:08:32,069 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:08:32,069 INFO L791 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 135#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; 138#L367 assume !(main_~length~0#1 < 1); 136#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; 137#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; 139#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 130#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 131#L375-4 main_~j~0#1 := 1; 128#L380-2 [2021-12-14 23:08:32,069 INFO L793 eck$LassoCheckResult]: Loop: 128#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); 129#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; 128#L380-2 [2021-12-14 23:08:32,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:32,069 INFO L85 PathProgramCache]: Analyzing trace with hash 180522006, now seen corresponding path program 1 times [2021-12-14 23:08:32,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:32,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908299179] [2021-12-14 23:08:32,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:32,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:08:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:08:32,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:08:32,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908299179] [2021-12-14 23:08:32,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908299179] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:08:32,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:08:32,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 23:08:32,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645304403] [2021-12-14 23:08:32,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:08:32,108 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:08:32,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:32,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 1 times [2021-12-14 23:08:32,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:32,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393342110] [2021-12-14 23:08:32,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:32,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:32,113 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:08:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:32,117 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:08:32,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:08:32,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 23:08:32,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 23:08:32,178 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-14 23:08:32,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:08:32,196 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2021-12-14 23:08:32,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 23:08:32,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2021-12-14 23:08:32,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-14 23:08:32,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2021-12-14 23:08:32,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-14 23:08:32,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-14 23:08:32,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2021-12-14 23:08:32,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:08:32,202 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2021-12-14 23:08:32,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2021-12-14 23:08:32,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2021-12-14 23:08:32,203 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-14 23:08:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2021-12-14 23:08:32,203 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2021-12-14 23:08:32,203 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2021-12-14 23:08:32,203 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:08:32,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2021-12-14 23:08:32,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-14 23:08:32,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:08:32,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:08:32,207 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:08:32,207 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:08:32,207 INFO L791 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 163#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; 170#L367 assume !(main_~length~0#1 < 1); 164#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; 165#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; 171#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 166#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; 167#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 168#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 169#L375-4 main_~j~0#1 := 1; 160#L380-2 [2021-12-14 23:08:32,208 INFO L793 eck$LassoCheckResult]: Loop: 160#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); 161#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; 160#L380-2 [2021-12-14 23:08:32,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:32,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1683012600, now seen corresponding path program 1 times [2021-12-14 23:08:32,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:32,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532606273] [2021-12-14 23:08:32,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:32,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:32,234 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:08:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:32,253 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:08:32,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:32,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 2 times [2021-12-14 23:08:32,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:32,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773794504] [2021-12-14 23:08:32,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:32,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:32,260 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:08:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:32,267 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:08:32,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:32,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1827560517, now seen corresponding path program 1 times [2021-12-14 23:08:32,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:32,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120991172] [2021-12-14 23:08:32,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:32,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:08:32,302 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-14 23:08:32,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:08:32,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120991172] [2021-12-14 23:08:32,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120991172] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:08:32,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124008686] [2021-12-14 23:08:32,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:32,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:08:32,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:32,328 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-14 23:08:32,329 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-14 23:08:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:08:32,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 23:08:32,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:08:32,390 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-14 23:08:32,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:08:32,417 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-14 23:08:32,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124008686] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:08:32,417 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:08:32,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2021-12-14 23:08:32,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584358683] [2021-12-14 23:08:32,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:08:32,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:08:32,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 23:08:32,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 23:08:32,471 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:08:32,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:08:32,521 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2021-12-14 23:08:32,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 23:08:32,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2021-12-14 23:08:32,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-14 23:08:32,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 15 states and 17 transitions. [2021-12-14 23:08:32,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-14 23:08:32,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-14 23:08:32,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2021-12-14 23:08:32,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:08:32,524 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-14 23:08:32,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2021-12-14 23:08:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-12-14 23:08:32,524 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-14 23:08:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-12-14 23:08:32,525 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-14 23:08:32,525 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-14 23:08:32,525 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:08:32,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2021-12-14 23:08:32,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-14 23:08:32,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:08:32,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:08:32,526 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:08:32,526 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:08:32,526 INFO L791 eck$LassoCheckResult]: Stem: 288#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 289#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; 293#L367 assume !(main_~length~0#1 < 1); 290#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; 291#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; 292#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 284#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; 285#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 286#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; 287#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 295#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 294#L375-4 main_~j~0#1 := 1; 282#L380-2 [2021-12-14 23:08:32,526 INFO L793 eck$LassoCheckResult]: Loop: 282#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); 283#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; 282#L380-2 [2021-12-14 23:08:32,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:32,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1827505318, now seen corresponding path program 2 times [2021-12-14 23:08:32,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:32,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259011559] [2021-12-14 23:08:32,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:32,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:32,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:08:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:32,543 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:08:32,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:32,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 3 times [2021-12-14 23:08:32,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:32,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092014439] [2021-12-14 23:08:32,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:32,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:32,547 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:08:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:32,549 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:08:32,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:32,549 INFO L85 PathProgramCache]: Analyzing trace with hash 409014941, now seen corresponding path program 2 times [2021-12-14 23:08:32,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:32,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987473276] [2021-12-14 23:08:32,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:32,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:32,576 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:08:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:32,585 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:08:32,824 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:08:32,824 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:08:32,824 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:08:32,824 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:08:32,824 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:08:32,824 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:32,824 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:08:32,824 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:08:32,824 INFO L133 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration4_Lasso [2021-12-14 23:08:32,824 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:08:32,824 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:08:32,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:32,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:32,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:32,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:32,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:32,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:32,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:32,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:32,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:32,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:32,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:32,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:08:33,153 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:08:33,153 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:08:33,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:33,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:33,154 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:33,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-14 23:08:33,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:33,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:33,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:08:33,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:33,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:33,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:33,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:08:33,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:08:33,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:33,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-14 23:08:33,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:33,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:33,218 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:33,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-14 23:08:33,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:33,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:33,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:08:33,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:33,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:33,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:33,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:08:33,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:08:33,287 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:33,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-14 23:08:33,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:33,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:33,305 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:33,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-14 23:08:33,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:33,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:33,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:08:33,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:33,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:33,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:33,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:08:33,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:08:33,331 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:33,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-14 23:08:33,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:33,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:33,359 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:33,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-14 23:08:33,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:33,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:33,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:33,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:33,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:33,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:08:33,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:08:33,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:33,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-14 23:08:33,400 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:33,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:33,400 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:33,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-14 23:08:33,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:33,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:33,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:08:33,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:33,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:33,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:33,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:08:33,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:08:33,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:33,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-14 23:08:33,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:33,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:33,433 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:33,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:33,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-14 23:08:33,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:33,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:08:33,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:33,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:33,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:33,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:08:33,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:08:33,464 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:33,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-12-14 23:08:33,480 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:33,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:33,480 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:33,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-14 23:08:33,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:33,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:33,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:33,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:33,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:33,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:08:33,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:08:33,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:08:33,527 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-14 23:08:33,528 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:33,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:33,529 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:33,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-14 23:08:33,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:08:33,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:08:33,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:08:33,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:08:33,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:08:33,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:08:33,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:08:33,558 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:08:33,577 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2021-12-14 23:08:33,578 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 13 variables to zero. [2021-12-14 23:08:33,578 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:08:33,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:33,589 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:08:33,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-14 23:08:33,591 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:08:33,598 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:08:33,599 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:08:33,599 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-14 23:08:33,615 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-14 23:08:33,633 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2021-12-14 23:08:33,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:08:33,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:08:33,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:08:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:08:33,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 23:08:33,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:08:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:08:33,686 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-14 23:08:33,686 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-14 23:08:33,694 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-14 23:08:33,694 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-14 23:08:33,695 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-14 23:08:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2021-12-14 23:08:33,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 2 letters. [2021-12-14 23:08:33,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:08:33,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2021-12-14 23:08:33,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:08:33,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 4 letters. [2021-12-14 23:08:33,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:08:33,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2021-12-14 23:08:33,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-14 23:08:33,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2021-12-14 23:08:33,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-14 23:08:33,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-14 23:08:33,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2021-12-14 23:08:33,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:08:33,697 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-14 23:08:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2021-12-14 23:08:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-14 23:08:33,698 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-14 23:08:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-14 23:08:33,698 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-14 23:08:33,698 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-14 23:08:33,698 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:08:33,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2021-12-14 23:08:33,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-14 23:08:33,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:08:33,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:08:33,699 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:08:33,699 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:08:33,699 INFO L791 eck$LassoCheckResult]: Stem: 410#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 411#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; 414#L367 assume !(main_~length~0#1 < 1); 412#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; 413#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; 415#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 406#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; 407#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 408#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; 409#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 418#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 416#L375-4 main_~j~0#1 := 1; 417#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); 405#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; 401#L380-2 [2021-12-14 23:08:33,700 INFO L793 eck$LassoCheckResult]: Loop: 401#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); 402#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; 401#L380-2 [2021-12-14 23:08:33,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:33,700 INFO L85 PathProgramCache]: Analyzing trace with hash 409014943, now seen corresponding path program 1 times [2021-12-14 23:08:33,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:33,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271313642] [2021-12-14 23:08:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:33,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:08:33,864 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-14 23:08:33,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:08:33,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271313642] [2021-12-14 23:08:33,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271313642] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:08:33,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137734016] [2021-12-14 23:08:33,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:33,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:08:33,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:33,866 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:08:33,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-14 23:08:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:08:33,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-14 23:08:33,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:08:33,964 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-14 23:08:33,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:33,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 23:08:34,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:08:34,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:34,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:34,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:08:34,061 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:08:34,062 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-14 23:08:34,068 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-14 23:08:34,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:08:34,205 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-14 23:08:34,656 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_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 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_ULTIMATE.start_main_~j~0#1_56| 0) (< v_ArrVal_60 |c_ULTIMATE.start_main_~value~0#1|))) is different from false [2021-12-14 23:08:35,144 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_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 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_ULTIMATE.start_main_~j~0#1_56| 0) (< v_ArrVal_60 |c_ULTIMATE.start_main_~value~0#1|))) is different from false [2021-12-14 23:08:35,159 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-14 23:08:35,175 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-12-14 23:08:35,176 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 814 treesize of output 724 [2021-12-14 23:08:35,301 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-14 23:08:35,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137734016] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:08:35,302 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:08:35,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 18 [2021-12-14 23:08:35,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996702120] [2021-12-14 23:08:35,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:08:35,303 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:08:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:35,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 4 times [2021-12-14 23:08:35,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:35,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293768374] [2021-12-14 23:08:35,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:35,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:35,318 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:08:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:35,322 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:08:35,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:08:35,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-14 23:08:35,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=218, Unknown=2, NotChecked=62, Total=342 [2021-12-14 23:08:35,374 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 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-14 23:08:35,814 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (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_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 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_ULTIMATE.start_main_~j~0#1_56| 0) (< v_ArrVal_60 |c_ULTIMATE.start_main_~value~0#1|))) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 1) |c_ULTIMATE.start_main_~value~0#1|)) is different from false [2021-12-14 23:08:36,224 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_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 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_ULTIMATE.start_main_~j~0#1_56| 0) (< v_ArrVal_60 |c_ULTIMATE.start_main_~value~0#1|))) (= |c_ULTIMATE.start_main_~i~0#1| 1) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) |c_ULTIMATE.start_main_~arr~0#1.offset|) 1) |c_ULTIMATE.start_main_~value~0#1|)) is different from false [2021-12-14 23:08:36,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:08:36,353 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2021-12-14 23:08:36,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 23:08:36,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2021-12-14 23:08:36,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-14 23:08:36,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 25 transitions. [2021-12-14 23:08:36,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-14 23:08:36,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-14 23:08:36,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2021-12-14 23:08:36,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:08:36,355 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-14 23:08:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2021-12-14 23:08:36,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-12-14 23:08:36,355 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-14 23:08:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-12-14 23:08:36,356 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-12-14 23:08:36,356 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-12-14 23:08:36,356 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-14 23:08:36,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2021-12-14 23:08:36,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-14 23:08:36,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:08:36,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:08:36,356 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:08:36,356 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:08:36,357 INFO L791 eck$LassoCheckResult]: Stem: 568#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 569#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; 572#L367 assume !(main_~length~0#1 < 1); 570#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; 571#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; 573#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 564#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; 565#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 566#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; 567#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 578#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; 577#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 576#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 574#L375-4 main_~j~0#1 := 1; 575#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); 563#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; 559#L380-2 [2021-12-14 23:08:36,357 INFO L793 eck$LassoCheckResult]: Loop: 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); 560#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; 559#L380-2 [2021-12-14 23:08:36,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:36,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2020585215, now seen corresponding path program 2 times [2021-12-14 23:08:36,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:36,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065406349] [2021-12-14 23:08:36,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:36,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:08:36,503 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-14 23:08:36,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:08:36,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065406349] [2021-12-14 23:08:36,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065406349] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:08:36,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264136330] [2021-12-14 23:08:36,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:08:36,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:08:36,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:36,516 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-14 23:08:36,559 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-14 23:08:36,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:08:36,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:08:36,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-14 23:08:36,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:08:36,620 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-14 23:08:36,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:36,652 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-14 23:08:36,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:36,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:36,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:36,713 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:08:36,713 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-14 23:08:36,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:08:36,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:36,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:36,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:08:36,772 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:08:36,772 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-14 23:08:36,785 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-14 23:08:36,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:08:37,413 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_82 Int) (|v_ULTIMATE.start_main_~j~0#1_60| Int)) (or (< 1 |v_ULTIMATE.start_main_~j~0#1_60|) (<= |v_ULTIMATE.start_main_~j~0#1_60| 0) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_82)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_60| 4))) (<= (+ 1 (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 (- 4)))) (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1)))))) is different from false [2021-12-14 23:08:49,466 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_42| Int)) (or (forall ((v_ArrVal_82 Int) (|v_ULTIMATE.start_main_~j~0#1_60| Int)) (or (< 1 |v_ULTIMATE.start_main_~j~0#1_60|) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_82)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_60| 4))) (<= (+ (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 (- 4))) 1) (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1)))) (<= |v_ULTIMATE.start_main_~j~0#1_60| 0))) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-14 23:08:50,193 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_80 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int) (v_ArrVal_82 Int) (|v_ULTIMATE.start_main_~j~0#1_60| Int)) (or (< v_ArrVal_80 |c_ULTIMATE.start_main_~value~0#1|) (< 1 |v_ULTIMATE.start_main_~j~0#1_60|) (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_80) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_82)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_60| 4))) (<= (+ (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 (- 4))) 1) (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1)))) (<= |v_ULTIMATE.start_main_~j~0#1_60| 0) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-14 23:08:50,912 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_80 Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int) (v_ArrVal_82 Int) (|v_ULTIMATE.start_main_~j~0#1_60| Int)) (or (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_80) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4)) v_ArrVal_82)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_60| 4))) (<= (+ (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 (- 4))) 1) (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1)))) (< v_ArrVal_80 |c_ULTIMATE.start_main_~value~0#1|) (< 1 |v_ULTIMATE.start_main_~j~0#1_60|) (< |v_ULTIMATE.start_main_~i~0#1_42| (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (<= |v_ULTIMATE.start_main_~j~0#1_60| 0))) is different from false [2021-12-14 23:08:50,926 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-14 23:08:50,935 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-12-14 23:08:50,936 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 7090 treesize of output 6674 [2021-12-14 23:08:51,631 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-14 23:08:51,631 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-14 23:08:51,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2021-12-14 23:08:51,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118128075] [2021-12-14 23:08:51,631 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-14 23:08:51,632 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:08:51,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:51,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 5 times [2021-12-14 23:08:51,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:51,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964746309] [2021-12-14 23:08:51,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:51,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:51,636 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:08:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:51,641 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:08:51,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:08:51,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 23:08:51,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=215, Unknown=4, NotChecked=132, Total=420 [2021-12-14 23:08:51,691 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 7 Second operand has 11 states, 10 states have (on average 1.6) 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-14 23:08:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:08:51,748 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2021-12-14 23:08:51,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 23:08:51,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2021-12-14 23:08:51,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-14 23:08:51,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 37 transitions. [2021-12-14 23:08:51,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-14 23:08:51,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-14 23:08:51,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2021-12-14 23:08:51,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:08:51,750 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-12-14 23:08:51,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2021-12-14 23:08:51,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2021-12-14 23:08:51,751 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-14 23:08:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2021-12-14 23:08:51,751 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-12-14 23:08:51,751 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-12-14 23:08:51,751 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-14 23:08:51,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2021-12-14 23:08:51,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-14 23:08:51,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:08:51,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:08:51,752 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:08:51,752 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:08:51,752 INFO L791 eck$LassoCheckResult]: Stem: 715#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 716#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; 723#L367 assume !(main_~length~0#1 < 1); 717#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; 718#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; 724#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 719#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; 720#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 721#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; 722#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 727#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; 730#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 733#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 732#L375-4 main_~j~0#1 := 1; 731#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); 713#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; 712#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); 714#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; 710#L380-2 [2021-12-14 23:08:51,752 INFO L793 eck$LassoCheckResult]: Loop: 710#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); 711#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; 710#L380-2 [2021-12-14 23:08:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:51,752 INFO L85 PathProgramCache]: Analyzing trace with hash -457174268, now seen corresponding path program 1 times [2021-12-14 23:08:51,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:51,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651120836] [2021-12-14 23:08:51,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:51,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:08:51,888 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-14 23:08:51,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:08:51,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651120836] [2021-12-14 23:08:51,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651120836] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:08:51,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247925251] [2021-12-14 23:08:51,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:51,889 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:08:51,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:51,890 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-14 23:08:51,891 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-14 23:08:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:08:51,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-14 23:08:51,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:08:51,995 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-14 23:08:52,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:52,042 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-14 23:08:52,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:52,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:08:52,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:52,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:08:52,152 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:08:52,152 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-14 23:08:52,154 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-14 23:08:52,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:08:52,304 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-14 23:08:52,309 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-14 23:08:52,309 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 654 treesize of output 598 [2021-12-14 23:08:52,394 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-14 23:08:52,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247925251] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:08:52,395 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:08:52,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 25 [2021-12-14 23:08:52,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328214083] [2021-12-14 23:08:52,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:08:52,396 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:08:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:52,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 6 times [2021-12-14 23:08:52,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:52,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547636743] [2021-12-14 23:08:52,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:52,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:52,399 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:08:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:08:52,401 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:08:52,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:08:52,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-14 23:08:52,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2021-12-14 23:08:52,448 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 8 Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:08:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:08:52,825 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2021-12-14 23:08:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-14 23:08:52,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 66 transitions. [2021-12-14 23:08:52,826 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-14 23:08:52,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 51 states and 64 transitions. [2021-12-14 23:08:52,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-12-14 23:08:52,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-12-14 23:08:52,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2021-12-14 23:08:52,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:08:52,828 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 64 transitions. [2021-12-14 23:08:52,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2021-12-14 23:08:52,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2021-12-14 23:08:52,830 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-14 23:08:52,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2021-12-14 23:08:52,830 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2021-12-14 23:08:52,830 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2021-12-14 23:08:52,830 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-14 23:08:52,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2021-12-14 23:08:52,830 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-14 23:08:52,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:08:52,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:08:52,831 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:08:52,831 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:08:52,831 INFO L791 eck$LassoCheckResult]: Stem: 960#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 961#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; 966#L367 assume !(main_~length~0#1 < 1); 962#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; 963#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; 967#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 956#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; 957#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 970#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; 974#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 958#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; 959#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 983#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; 973#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 971#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 968#L375-4 main_~j~0#1 := 1; 969#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); 984#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; 982#L380-2 [2021-12-14 23:08:52,831 INFO L793 eck$LassoCheckResult]: Loop: 982#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); 981#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; 982#L380-2 [2021-12-14 23:08:52,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:08:52,831 INFO L85 PathProgramCache]: Analyzing trace with hash -404128029, now seen corresponding path program 3 times [2021-12-14 23:08:52,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:08:52,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924837735] [2021-12-14 23:08:52,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:08:52,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:08:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:08:53,011 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-14 23:08:53,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:08:53,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924837735] [2021-12-14 23:08:53,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924837735] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:08:53,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407382104] [2021-12-14 23:08:53,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 23:08:53,012 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:08:53,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:08:53,022 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-14 23:08:53,022 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-14 23:08:53,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-14 23:08:53,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:08:53,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-14 23:08:53,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:08:53,103 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-14 23:08:53,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:53,142 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-14 23:08:53,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:53,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:53,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:53,181 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:08:53,181 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-14 23:08:53,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:53,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:53,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:53,214 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:08:53,214 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-14 23:08:53,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:53,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:08:53,269 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:08:53,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:08:53,273 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 23:08:53,273 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-14 23:08:53,282 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-14 23:08:53,282 INFO L328 TraceCheckSpWp]: Computing backward predicates...