./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/TelAviv-Amir-Minimum-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/TelAviv-Amir-Minimum-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 b772ea6cbe9184ba53f1c8d4bd36c3171ff0dd060729f60e2639b94874c209a6 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:01:36,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:01:36,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:01:36,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:01:36,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:01:36,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:01:36,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:01:36,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:01:36,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:01:36,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:01:36,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:01:36,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:01:36,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:01:36,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:01:36,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:01:36,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:01:36,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:01:36,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:01:36,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:01:36,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:01:36,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:01:36,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:01:36,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:01:36,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:01:36,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:01:36,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:01:36,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:01:36,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:01:36,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:01:36,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:01:36,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:01:36,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:01:36,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:01:36,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:01:36,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:01:36,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:01:36,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:01:36,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:01:36,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:01:36,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:01:36,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:01:36,776 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-15 17:01:36,810 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:01:36,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:01:36,811 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:01:36,811 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:01:36,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:01:36,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:01:36,813 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:01:36,813 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:01:36,817 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:01:36,817 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:01:36,818 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:01:36,818 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:01:36,818 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:01:36,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:01:36,818 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:01:36,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:01:36,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:01:36,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:01:36,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:01:36,819 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:01:36,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:01:36,819 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:01:36,819 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:01:36,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:01:36,820 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:01:36,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:01:36,821 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:01:36,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:01:36,821 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:01:36,822 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:01:36,822 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 -> b772ea6cbe9184ba53f1c8d4bd36c3171ff0dd060729f60e2639b94874c209a6 [2021-12-15 17:01:37,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:01:37,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:01:37,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:01:37,039 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:01:37,043 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:01:37,046 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/TelAviv-Amir-Minimum-alloca.i [2021-12-15 17:01:37,090 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d9f485b/d202a0abdaed403d9e7487a5c5f92c11/FLAGf67204874 [2021-12-15 17:01:37,495 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:01:37,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/TelAviv-Amir-Minimum-alloca.i [2021-12-15 17:01:37,504 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d9f485b/d202a0abdaed403d9e7487a5c5f92c11/FLAGf67204874 [2021-12-15 17:01:37,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d9f485b/d202a0abdaed403d9e7487a5c5f92c11 [2021-12-15 17:01:37,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:01:37,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:01:37,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:01:37,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:01:37,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:01:37,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:01:37" (1/1) ... [2021-12-15 17:01:37,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e575c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:37, skipping insertion in model container [2021-12-15 17:01:37,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:01:37" (1/1) ... [2021-12-15 17:01:37,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:01:37,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:01:38,045 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:01:38,064 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:01:38,108 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:01:38,124 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:01:38,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:38 WrapperNode [2021-12-15 17:01:38,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:01:38,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:01:38,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:01:38,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:01:38,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:38" (1/1) ... [2021-12-15 17:01:38,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:38" (1/1) ... [2021-12-15 17:01:38,159 INFO L137 Inliner]: procedures = 110, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2021-12-15 17:01:38,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:01:38,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:01:38,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:01:38,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:01:38,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:38" (1/1) ... [2021-12-15 17:01:38,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:38" (1/1) ... [2021-12-15 17:01:38,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:38" (1/1) ... [2021-12-15 17:01:38,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:38" (1/1) ... [2021-12-15 17:01:38,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:38" (1/1) ... [2021-12-15 17:01:38,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:38" (1/1) ... [2021-12-15 17:01:38,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:38" (1/1) ... [2021-12-15 17:01:38,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:01:38,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:01:38,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:01:38,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:01:38,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:38" (1/1) ... [2021-12-15 17:01:38,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:38,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:38,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:38,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:01:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:01:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:01:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 17:01:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:01:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:01:38,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:01:38,281 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:01:38,283 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:01:38,386 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:01:38,390 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:01:38,390 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:01:38,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:01:38 BoogieIcfgContainer [2021-12-15 17:01:38,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:01:38,394 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:01:38,394 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:01:38,409 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:01:38,409 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:01:38,410 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:01:37" (1/3) ... [2021-12-15 17:01:38,410 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4103497d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:01:38, skipping insertion in model container [2021-12-15 17:01:38,411 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:01:38,411 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:38" (2/3) ... [2021-12-15 17:01:38,411 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4103497d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:01:38, skipping insertion in model container [2021-12-15 17:01:38,411 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:01:38,412 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:01:38" (3/3) ... [2021-12-15 17:01:38,413 INFO L388 chiAutomizerObserver]: Analyzing ICFG TelAviv-Amir-Minimum-alloca.i [2021-12-15 17:01:38,475 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:01:38,476 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:01:38,476 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:01:38,476 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:01:38,476 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:01:38,476 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:01:38,476 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:01:38,476 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:01:38,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:38,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 17:01:38,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:38,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:38,515 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:01:38,515 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:01:38,515 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:01:38,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:38,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 17:01:38,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:38,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:38,519 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:01:38,519 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:01:38,523 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 12#L551-2true [2021-12-15 17:01:38,524 INFO L793 eck$LassoCheckResult]: Loop: 12#L551-2true call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 15#L550-1true assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; 7#L550-3true assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 13#L551true assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4); 9#L552true assume main_#t~mem8#1 < main_#t~mem9#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1; 10#L552-2true call write~int(main_#t~nondet12#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet12#1; 12#L551-2true [2021-12-15 17:01:38,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:38,531 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:01:38,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:38,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777149685] [2021-12-15 17:01:38,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:38,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:38,608 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:38,632 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:38,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:38,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1097700139, now seen corresponding path program 1 times [2021-12-15 17:01:38,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:38,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666299758] [2021-12-15 17:01:38,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:38,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:38,654 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:38,667 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:38,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:38,668 INFO L85 PathProgramCache]: Analyzing trace with hash 177749357, now seen corresponding path program 1 times [2021-12-15 17:01:38,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:38,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211011612] [2021-12-15 17:01:38,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:38,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:38,690 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:38,711 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:39,116 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:01:39,116 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:01:39,117 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:01:39,117 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:01:39,117 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:01:39,117 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:39,117 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:01:39,118 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:01:39,118 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca.i_Iteration1_Lasso [2021-12-15 17:01:39,118 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:01:39,119 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:01:39,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:39,581 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:01:39,584 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:01:39,585 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:39,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:39,586 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:39,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:39,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:39,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:39,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:39,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:39,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:39,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:39,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-15 17:01:39,620 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:39,665 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-15 17:01:39,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:39,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:39,666 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:39,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-15 17:01:39,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:39,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:39,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:39,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:39,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:39,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:39,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:39,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:39,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:39,717 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:39,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:39,718 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:39,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-15 17:01:39,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:39,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:39,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:39,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:39,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:39,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:39,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:39,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:39,750 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:01:39,754 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-15 17:01:39,754 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-15 17:01:39,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:39,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:39,768 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:39,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-15 17:01:39,819 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:01:39,819 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-15 17:01:39,819 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:01:39,820 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_1 Supporting invariants [] [2021-12-15 17:01:39,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:39,863 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-12-15 17:01:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:39,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:01:39,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:39,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 17:01:39,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:40,084 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-12-15 17:01:40,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 29 [2021-12-15 17:01:40,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:40,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:40,146 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-15 17:01:40,147 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:40,220 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 53 states and 65 transitions. Complement of second has 12 states. [2021-12-15 17:01:40,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-15 17:01:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2021-12-15 17:01:40,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 2 letters. Loop has 6 letters. [2021-12-15 17:01:40,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:40,230 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:01:40,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:40,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:01:40,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:40,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 17:01:40,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:40,387 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-12-15 17:01:40,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 29 [2021-12-15 17:01:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:40,405 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-15 17:01:40,405 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:40,488 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 54 states and 67 transitions. Complement of second has 14 states. [2021-12-15 17:01:40,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2021-12-15 17:01:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2021-12-15 17:01:40,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 2 letters. Loop has 6 letters. [2021-12-15 17:01:40,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:40,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 8 letters. Loop has 6 letters. [2021-12-15 17:01:40,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:40,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 2 letters. Loop has 12 letters. [2021-12-15 17:01:40,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:40,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 67 transitions. [2021-12-15 17:01:40,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 17:01:40,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 26 states and 36 transitions. [2021-12-15 17:01:40,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-12-15 17:01:40,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-15 17:01:40,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2021-12-15 17:01:40,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:40,503 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2021-12-15 17:01:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2021-12-15 17:01:40,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2021-12-15 17:01:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2021-12-15 17:01:40,524 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-12-15 17:01:40,524 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-12-15 17:01:40,525 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:01:40,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2021-12-15 17:01:40,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 17:01:40,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:40,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:40,528 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:01:40,528 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:01:40,528 INFO L791 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 277#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 289#L551-2 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 282#L550-1 assume !main_#t~short6#1; 292#L550-3 assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 291#L551 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4); 278#L559 [2021-12-15 17:01:40,528 INFO L793 eck$LassoCheckResult]: Loop: 278#L559 assume main_#t~mem13#1 < main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem15#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem15#1; 279#L559-2 call write~int(main_#t~nondet17#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet17#1; 273#L551-2 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 280#L550-1 assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; 287#L550-3 assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 283#L551 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4); 278#L559 [2021-12-15 17:01:40,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash 889571380, now seen corresponding path program 1 times [2021-12-15 17:01:40,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:40,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695823972] [2021-12-15 17:01:40,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:40,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:40,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:40,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695823972] [2021-12-15 17:01:40,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695823972] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:01:40,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:01:40,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:01:40,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976044426] [2021-12-15 17:01:40,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:01:40,570 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:01:40,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:40,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1866654676, now seen corresponding path program 1 times [2021-12-15 17:01:40,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:40,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543970569] [2021-12-15 17:01:40,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:40,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:40,604 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:40,611 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:40,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:01:40,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:01:40,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:01:40,752 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:01:40,762 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2021-12-15 17:01:40,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:01:40,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2021-12-15 17:01:40,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 17:01:40,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 21 states and 27 transitions. [2021-12-15 17:01:40,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-15 17:01:40,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-12-15 17:01:40,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2021-12-15 17:01:40,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:40,767 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-12-15 17:01:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2021-12-15 17:01:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-15 17:01:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2021-12-15 17:01:40,768 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-12-15 17:01:40,768 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-12-15 17:01:40,768 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:01:40,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2021-12-15 17:01:40,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 17:01:40,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:40,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:40,769 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:01:40,769 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:01:40,769 INFO L791 eck$LassoCheckResult]: Stem: 327#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 331#L551-2 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 333#L550-1 assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; 338#L550-3 assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 334#L551 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4); 329#L559 [2021-12-15 17:01:40,769 INFO L793 eck$LassoCheckResult]: Loop: 329#L559 assume main_#t~mem13#1 < main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem15#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem15#1; 330#L559-2 call write~int(main_#t~nondet17#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet17#1; 324#L551-2 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 343#L550-1 assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; 342#L550-3 assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 341#L551 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4); 329#L559 [2021-12-15 17:01:40,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:40,769 INFO L85 PathProgramCache]: Analyzing trace with hash 889569458, now seen corresponding path program 1 times [2021-12-15 17:01:40,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:40,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957272267] [2021-12-15 17:01:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:40,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:40,782 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:40,788 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:40,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:40,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1866654676, now seen corresponding path program 2 times [2021-12-15 17:01:40,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:40,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230179215] [2021-12-15 17:01:40,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:40,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:40,794 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:40,800 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1277664197, now seen corresponding path program 1 times [2021-12-15 17:01:40,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:40,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825070775] [2021-12-15 17:01:40,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:40,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:40,812 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:40,824 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:41,204 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:01:41,204 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:01:41,204 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:01:41,204 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:01:41,205 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:01:41,205 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:41,205 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:01:41,205 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:01:41,205 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca.i_Iteration3_Lasso [2021-12-15 17:01:41,205 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:01:41,205 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:01:41,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:41,669 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:01:41,669 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:01:41,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:41,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:41,670 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:41,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-15 17:01:41,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:41,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:41,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:41,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:41,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:41,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:41,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:41,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:41,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:41,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:41,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:41,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:41,710 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:41,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-15 17:01:41,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:41,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:41,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:41,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:41,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:41,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:41,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:41,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:41,763 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-15 17:01:41,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:41,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:41,788 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:41,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-15 17:01:41,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:41,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:41,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:41,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:41,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:41,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:41,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:41,823 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:01:41,835 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-15 17:01:41,835 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2021-12-15 17:01:41,836 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:41,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:41,848 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:41,857 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:01:41,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-15 17:01:41,876 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:01:41,876 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:01:41,876 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2 Supporting invariants [] [2021-12-15 17:01:41,894 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-15 17:01:41,911 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2021-12-15 17:01:41,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:41,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 17:01:41,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:41,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 17:01:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:41,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 17:01:41,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:41,989 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 28 treesize of output 16 [2021-12-15 17:01:42,005 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 16 treesize of output 18 [2021-12-15 17:01:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:42,057 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2021-12-15 17:01:42,057 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:42,115 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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 45 states and 59 transitions. Complement of second has 10 states. [2021-12-15 17:01:42,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-15 17:01:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2021-12-15 17:01:42,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 6 letters. Loop has 6 letters. [2021-12-15 17:01:42,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:42,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 12 letters. Loop has 6 letters. [2021-12-15 17:01:42,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:42,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 6 letters. Loop has 12 letters. [2021-12-15 17:01:42,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:42,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2021-12-15 17:01:42,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-12-15 17:01:42,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 39 states and 51 transitions. [2021-12-15 17:01:42,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-12-15 17:01:42,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-12-15 17:01:42,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2021-12-15 17:01:42,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:42,118 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2021-12-15 17:01:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2021-12-15 17:01:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2021-12-15 17:01:42,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2021-12-15 17:01:42,120 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2021-12-15 17:01:42,120 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2021-12-15 17:01:42,120 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:01:42,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2021-12-15 17:01:42,121 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-12-15 17:01:42,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:42,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:42,121 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:01:42,121 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:01:42,121 INFO L791 eck$LassoCheckResult]: Stem: 509#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 510#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 531#L551-2 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 518#L550-1 assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; 525#L550-3 assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 526#L551 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4); 533#L552 assume !(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call main_#t~mem11#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem11#1; 537#L552-2 [2021-12-15 17:01:42,121 INFO L793 eck$LassoCheckResult]: Loop: 537#L552-2 call write~int(main_#t~nondet12#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet12#1; 515#L551-2 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 516#L550-1 assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; 540#L550-3 assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 539#L551 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4); 538#L552 assume main_#t~mem8#1 < main_#t~mem9#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem10#1; 537#L552-2 [2021-12-15 17:01:42,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:42,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849169, now seen corresponding path program 1 times [2021-12-15 17:01:42,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:42,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654621844] [2021-12-15 17:01:42,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:42,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:42,130 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:42,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:42,160 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:42,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1695900439, now seen corresponding path program 2 times [2021-12-15 17:01:42,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:42,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275085888] [2021-12-15 17:01:42,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:42,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:42,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:42,170 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:42,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:42,170 INFO L85 PathProgramCache]: Analyzing trace with hash 272239527, now seen corresponding path program 1 times [2021-12-15 17:01:42,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:42,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423883442] [2021-12-15 17:01:42,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:42,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:42,182 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:42,191 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:42,514 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:01:42,514 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:01:42,514 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:01:42,514 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:01:42,514 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:01:42,514 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:42,514 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:01:42,514 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:01:42,514 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca.i_Iteration4_Lasso [2021-12-15 17:01:42,514 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:01:42,514 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:01:42,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:42,865 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:01:42,865 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:01:42,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:42,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:42,866 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:42,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-15 17:01:42,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:42,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:42,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:42,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:42,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:42,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:42,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:42,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:42,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:42,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:42,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:42,913 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:42,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-15 17:01:42,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:42,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:42,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:42,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:42,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:42,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:42,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:42,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:42,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:42,957 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-15 17:01:42,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:42,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:42,959 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:42,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-15 17:01:42,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:42,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:42,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:42,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:42,967 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-15 17:01:42,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:42,968 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-15 17:01:42,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:42,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:42,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-12-15 17:01:42,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:42,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:42,991 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:42,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-15 17:01:42,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:42,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:43,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:43,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:43,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:43,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:43,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:43,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:43,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:43,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:43,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:43,034 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:43,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-15 17:01:43,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:43,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:43,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:43,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:43,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:43,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:43,045 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:43,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:43,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:43,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:43,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:43,068 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:43,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-15 17:01:43,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:43,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:43,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:43,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:43,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:43,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:43,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:43,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:43,101 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-15 17:01:43,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:43,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:43,102 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:43,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-15 17:01:43,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:43,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:43,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:43,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:43,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:43,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:43,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:43,135 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:01:43,141 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-15 17:01:43,141 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2021-12-15 17:01:43,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:43,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:43,142 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:43,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-15 17:01:43,149 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:01:43,156 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:01:43,156 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:01:43,156 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_3 Supporting invariants [] [2021-12-15 17:01:43,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-12-15 17:01:43,192 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-12-15 17:01:43,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:43,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:01:43,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:43,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 17:01:43,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:43,258 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 17:01:43,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-12-15 17:01:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:43,364 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-15 17:01:43,364 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 47 transitions. cyclomatic complexity: 15 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:43,418 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 47 transitions. cyclomatic complexity: 15. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 84 states and 110 transitions. Complement of second has 11 states. [2021-12-15 17:01:43,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-15 17:01:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2021-12-15 17:01:43,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 7 letters. Loop has 6 letters. [2021-12-15 17:01:43,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:43,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 13 letters. Loop has 6 letters. [2021-12-15 17:01:43,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:43,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 7 letters. Loop has 12 letters. [2021-12-15 17:01:43,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:43,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 110 transitions. [2021-12-15 17:01:43,430 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2021-12-15 17:01:43,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 80 states and 104 transitions. [2021-12-15 17:01:43,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-12-15 17:01:43,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-12-15 17:01:43,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 104 transitions. [2021-12-15 17:01:43,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:43,431 INFO L681 BuchiCegarLoop]: Abstraction has 80 states and 104 transitions. [2021-12-15 17:01:43,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 104 transitions. [2021-12-15 17:01:43,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2021-12-15 17:01:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 74 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2021-12-15 17:01:43,435 INFO L704 BuchiCegarLoop]: Abstraction has 75 states and 98 transitions. [2021-12-15 17:01:43,435 INFO L587 BuchiCegarLoop]: Abstraction has 75 states and 98 transitions. [2021-12-15 17:01:43,435 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:01:43,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 98 transitions. [2021-12-15 17:01:43,436 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2021-12-15 17:01:43,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:43,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:43,436 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:01:43,436 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:01:43,436 INFO L791 eck$LassoCheckResult]: Stem: 745#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 746#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~short6#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 763#L551-2 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 791#L550-1 assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; 790#L550-3 assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 788#L551 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4); 789#L559 assume !(main_#t~mem13#1 < main_#t~mem14#1);havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem16#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem16#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1; 786#L559-2 [2021-12-15 17:01:43,436 INFO L793 eck$LassoCheckResult]: Loop: 786#L559-2 call write~int(main_#t~nondet17#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet17#1; 785#L551-2 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short6#1 := main_#t~mem4#1 > 0; 784#L550-1 assume main_#t~short6#1;call main_#t~mem5#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short6#1 := main_#t~mem5#1 > 0; 783#L550-3 assume !!main_#t~short6#1;havoc main_#t~mem4#1;havoc main_#t~mem5#1;havoc main_#t~short6#1; 781#L551 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4); 782#L559 assume main_#t~mem13#1 < main_#t~mem14#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem15#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem15#1; 786#L559-2 [2021-12-15 17:01:43,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:43,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849457, now seen corresponding path program 1 times [2021-12-15 17:01:43,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:43,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591534938] [2021-12-15 17:01:43,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:43,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:43,449 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:43,461 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:43,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:43,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1953563086, now seen corresponding path program 3 times [2021-12-15 17:01:43,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:43,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794055737] [2021-12-15 17:01:43,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:43,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:43,479 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:43,496 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:43,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:43,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1567075458, now seen corresponding path program 1 times [2021-12-15 17:01:43,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:43,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565772485] [2021-12-15 17:01:43,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:43,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:43,505 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:43,547 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:43,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:43,889 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:01:43,889 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:01:43,889 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:01:43,889 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:01:43,889 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:01:43,889 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:43,889 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:01:43,889 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:01:43,889 INFO L133 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum-alloca.i_Iteration5_Lasso [2021-12-15 17:01:43,889 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:01:43,889 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:01:43,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:44,246 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:01:44,246 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:01:44,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:44,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:44,247 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:44,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-15 17:01:44,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:44,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:44,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:44,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:44,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:44,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:44,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:44,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:44,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:44,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:44,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:44,280 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:44,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-15 17:01:44,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:44,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:44,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:44,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:44,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:44,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:44,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:44,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:44,322 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-15 17:01:44,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:44,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:44,323 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:44,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:44,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:44,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:44,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:44,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:44,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:44,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:44,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-15 17:01:44,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:44,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:44,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:44,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:44,367 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:44,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:44,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:44,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:44,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:44,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:44,384 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:44,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:44,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-15 17:01:44,403 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:01:44,408 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-15 17:01:44,408 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2021-12-15 17:01:44,408 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:44,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:44,409 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:44,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-15 17:01:44,412 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:01:44,433 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:01:44,433 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:01:44,433 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_4 Supporting invariants [] [2021-12-15 17:01:44,451 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-15 17:01:44,465 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-12-15 17:01:44,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:44,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:01:44,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:44,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 17:01:44,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:44,540 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 17:01:44,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-12-15 17:01:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:44,681 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-15 17:01:44,681 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 98 transitions. cyclomatic complexity: 32 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:44,720 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 98 transitions. cyclomatic complexity: 32. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 143 states and 186 transitions. Complement of second has 9 states. [2021-12-15 17:01:44,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-15 17:01:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2021-12-15 17:01:44,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 6 letters. [2021-12-15 17:01:44,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:44,723 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:01:44,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:44,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:01:44,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:44,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 17:01:44,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:44,778 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 17:01:44,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-12-15 17:01:44,910 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-15 17:01:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:44,914 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-15 17:01:44,915 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 98 transitions. cyclomatic complexity: 32 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:44,951 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 98 transitions. cyclomatic complexity: 32. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 143 states and 186 transitions. Complement of second has 9 states. [2021-12-15 17:01:44,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-15 17:01:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2021-12-15 17:01:44,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 6 letters. [2021-12-15 17:01:44,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:44,952 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:01:44,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:44,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:01:44,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:44,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 17:01:44,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:45,008 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 17:01:45,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-12-15 17:01:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:45,150 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-15 17:01:45,150 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 98 transitions. cyclomatic complexity: 32 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:45,185 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 98 transitions. cyclomatic complexity: 32. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 113 states and 146 transitions. Complement of second has 8 states. [2021-12-15 17:01:45,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-15 17:01:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2021-12-15 17:01:45,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 7 letters. Loop has 6 letters. [2021-12-15 17:01:45,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:45,190 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:01:45,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:45,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:01:45,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:45,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 17:01:45,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:45,253 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 17:01:45,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-12-15 17:01:45,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:45,365 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-15 17:01:45,365 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 98 transitions. cyclomatic complexity: 32 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:45,398 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 98 transitions. cyclomatic complexity: 32. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 113 states and 146 transitions. Complement of second has 8 states. [2021-12-15 17:01:45,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-15 17:01:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2021-12-15 17:01:45,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 7 letters. Loop has 6 letters. [2021-12-15 17:01:45,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:45,399 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:01:45,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:45,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:01:45,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:45,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 17:01:45,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:45,455 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 17:01:45,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-12-15 17:01:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:45,578 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-15 17:01:45,579 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 75 states and 98 transitions. cyclomatic complexity: 32 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:45,723 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 75 states and 98 transitions. cyclomatic complexity: 32 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 912 states and 1418 transitions. Complement of second has 82 states 10 powerset states72 rank states. The highest rank that occured is 7 [2021-12-15 17:01:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2021-12-15 17:01:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2021-12-15 17:01:45,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 59 transitions. Stem has 7 letters. Loop has 6 letters. [2021-12-15 17:01:45,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:45,726 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:01:45,726 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: no settings was sufficient at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:01:45,729 INFO L158 Benchmark]: Toolchain (without parser) took 7909.62ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 76.4MB in the beginning and 97.3MB in the end (delta: -20.9MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2021-12-15 17:01:45,729 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 79.7MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:01:45,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.29ms. Allocated memory is still 98.6MB. Free memory was 76.2MB in the beginning and 61.4MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-15 17:01:45,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.78ms. Allocated memory is still 98.6MB. Free memory was 61.4MB in the beginning and 59.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:01:45,730 INFO L158 Benchmark]: Boogie Preprocessor took 14.33ms. Allocated memory is still 98.6MB. Free memory was 59.4MB in the beginning and 58.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:01:45,730 INFO L158 Benchmark]: RCFGBuilder took 217.48ms. Allocated memory is still 98.6MB. Free memory was 58.3MB in the beginning and 72.7MB in the end (delta: -14.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 17:01:45,730 INFO L158 Benchmark]: BuchiAutomizer took 7334.36ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 72.7MB in the beginning and 97.3MB in the end (delta: -24.6MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2021-12-15 17:01:45,732 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 79.7MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.29ms. Allocated memory is still 98.6MB. Free memory was 76.2MB in the beginning and 61.4MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.78ms. Allocated memory is still 98.6MB. Free memory was 61.4MB in the beginning and 59.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.33ms. Allocated memory is still 98.6MB. Free memory was 59.4MB in the beginning and 58.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 217.48ms. Allocated memory is still 98.6MB. Free memory was 58.3MB in the beginning and 72.7MB in the end (delta: -14.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 7334.36ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 72.7MB in the beginning and 97.3MB in the end (delta: -24.6MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: no settings was sufficient de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: no settings was sufficient: de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:01:45,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no settings was sufficient