./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 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/java_Continue1-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 337340cdf38da99928295b0c576766fb8f09c8634f9763511165b0f7240edd89 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 14:28:57,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 14:28:57,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 14:28:57,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 14:28:57,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 14:28:57,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 14:28:57,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 14:28:57,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 14:28:57,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 14:28:57,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 14:28:57,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 14:28:57,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 14:28:57,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 14:28:57,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 14:28:57,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 14:28:57,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 14:28:57,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 14:28:57,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 14:28:57,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 14:28:57,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 14:28:57,488 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 14:28:57,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 14:28:57,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 14:28:57,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 14:28:57,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 14:28:57,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 14:28:57,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 14:28:57,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 14:28:57,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 14:28:57,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 14:28:57,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 14:28:57,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 14:28:57,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 14:28:57,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 14:28:57,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 14:28:57,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 14:28:57,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 14:28:57,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 14:28:57,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 14:28:57,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 14:28:57,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 14:28:57,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 14:28:57,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-23 14:28:57,518 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 14:28:57,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 14:28:57,521 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 14:28:57,521 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 14:28:57,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 14:28:57,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 14:28:57,523 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 14:28:57,523 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 14:28:57,523 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 14:28:57,524 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 14:28:57,524 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 14:28:57,524 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 14:28:57,524 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 14:28:57,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 14:28:57,524 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 14:28:57,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 14:28:57,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 14:28:57,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 14:28:57,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 14:28:57,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 14:28:57,526 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 14:28:57,526 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 14:28:57,527 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 14:28:57,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 14:28:57,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 14:28:57,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 14:28:57,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 14:28:57,527 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 14:28:57,528 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 14:28:57,528 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 -> 337340cdf38da99928295b0c576766fb8f09c8634f9763511165b0f7240edd89 [2022-07-23 14:28:57,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 14:28:57,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 14:28:57,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 14:28:57,740 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 14:28:57,740 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 14:28:57,741 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2022-07-23 14:28:57,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5aff9a5/fec9d2bc3b384ba6871c0ee4626a5e3f/FLAG83e283e16 [2022-07-23 14:28:58,166 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 14:28:58,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2022-07-23 14:28:58,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5aff9a5/fec9d2bc3b384ba6871c0ee4626a5e3f/FLAG83e283e16 [2022-07-23 14:28:58,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5aff9a5/fec9d2bc3b384ba6871c0ee4626a5e3f [2022-07-23 14:28:58,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 14:28:58,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 14:28:58,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 14:28:58,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 14:28:58,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 14:28:58,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:28:58" (1/1) ... [2022-07-23 14:28:58,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba17400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:58, skipping insertion in model container [2022-07-23 14:28:58,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:28:58" (1/1) ... [2022-07-23 14:28:58,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 14:28:58,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 14:28:58,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:28:58,434 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 14:28:58,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:28:58,485 INFO L208 MainTranslator]: Completed translation [2022-07-23 14:28:58,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:58 WrapperNode [2022-07-23 14:28:58,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 14:28:58,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 14:28:58,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 14:28:58,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 14:28:58,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:58" (1/1) ... [2022-07-23 14:28:58,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:58" (1/1) ... [2022-07-23 14:28:58,519 INFO L137 Inliner]: procedures = 109, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2022-07-23 14:28:58,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 14:28:58,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 14:28:58,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 14:28:58,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 14:28:58,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:58" (1/1) ... [2022-07-23 14:28:58,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:58" (1/1) ... [2022-07-23 14:28:58,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:58" (1/1) ... [2022-07-23 14:28:58,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:58" (1/1) ... [2022-07-23 14:28:58,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:58" (1/1) ... [2022-07-23 14:28:58,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:58" (1/1) ... [2022-07-23 14:28:58,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:58" (1/1) ... [2022-07-23 14:28:58,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 14:28:58,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 14:28:58,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 14:28:58,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 14:28:58,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:58" (1/1) ... [2022-07-23 14:28:58,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:58,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:58,567 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) [2022-07-23 14:28:58,579 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 [2022-07-23 14:28:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 14:28:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 14:28:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 14:28:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 14:28:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 14:28:58,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 14:28:58,677 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 14:28:58,678 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 14:28:58,791 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 14:28:58,795 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 14:28:58,795 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 14:28:58,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:28:58 BoogieIcfgContainer [2022-07-23 14:28:58,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 14:28:58,797 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 14:28:58,797 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 14:28:58,799 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 14:28:58,800 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:28:58,800 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 02:28:58" (1/3) ... [2022-07-23 14:28:58,800 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2620bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:28:58, skipping insertion in model container [2022-07-23 14:28:58,800 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:28:58,801 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:28:58" (2/3) ... [2022-07-23 14:28:58,801 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2620bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:28:58, skipping insertion in model container [2022-07-23 14:28:58,801 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:28:58,801 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:28:58" (3/3) ... [2022-07-23 14:28:58,802 INFO L354 chiAutomizerObserver]: Analyzing ICFG java_Continue1-alloca.i [2022-07-23 14:28:58,838 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 14:28:58,838 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 14:28:58,838 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 14:28:58,838 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 14:28:58,839 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 14:28:58,839 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 14:28:58,839 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 14:28:58,839 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 14:28:58,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2022-07-23 14:28:58,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:28:58,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:28:58,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:28:58,856 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:28:58,856 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 14:28:58,856 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 14:28:58,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2022-07-23 14:28:58,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:28:58,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:28:58,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:28:58,857 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:28:58,857 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 14:28:58,861 INFO L752 eck$LassoCheckResult]: Stem: 3#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~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_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 4#L552-3true [2022-07-23 14:28:58,862 INFO L754 eck$LassoCheckResult]: Loop: 4#L552-3true goto; 7#L554-1true call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9#L552-1true assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 10#L554true assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 4#L552-3true [2022-07-23 14:28:58,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:58,866 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-23 14:28:58,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:58,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246436932] [2022-07-23 14:28:58,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:58,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:58,940 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:58,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:58,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:58,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1109383, now seen corresponding path program 1 times [2022-07-23 14:28:58,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:58,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858000782] [2022-07-23 14:28:58,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:58,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:58,978 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:58,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:58,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:58,988 INFO L85 PathProgramCache]: Analyzing trace with hash 889536585, now seen corresponding path program 1 times [2022-07-23 14:28:58,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:58,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396904780] [2022-07-23 14:28:58,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:58,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:28:59,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:28:59,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396904780] [2022-07-23 14:28:59,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396904780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:28:59,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:28:59,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:28:59,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763528268] [2022-07-23 14:28:59,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:28:59,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:28:59,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 14:28:59,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 14:28:59,270 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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) [2022-07-23 14:28:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:28:59,294 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-07-23 14:28:59,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:28:59,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2022-07-23 14:28:59,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:28:59,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 11 transitions. [2022-07-23 14:28:59,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-23 14:28:59,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-23 14:28:59,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2022-07-23 14:28:59,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:28:59,304 INFO L369 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-07-23 14:28:59,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2022-07-23 14:28:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-23 14:28:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 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) [2022-07-23 14:28:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-07-23 14:28:59,320 INFO L392 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-07-23 14:28:59,320 INFO L374 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-07-23 14:28:59,320 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 14:28:59,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2022-07-23 14:28:59,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:28:59,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:28:59,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:28:59,321 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:28:59,321 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:28:59,322 INFO L752 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 40#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~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_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 37#L552-3 goto; 38#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 41#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 42#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 43#L554-1 [2022-07-23 14:28:59,322 INFO L754 eck$LassoCheckResult]: Loop: 43#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 46#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 44#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 43#L554-1 [2022-07-23 14:28:59,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:59,324 INFO L85 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2022-07-23 14:28:59,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:59,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989432141] [2022-07-23 14:28:59,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:59,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:59,364 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:59,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:59,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2022-07-23 14:28:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:59,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67026909] [2022-07-23 14:28:59,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:59,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:59,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:59,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:59,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:59,410 INFO L85 PathProgramCache]: Analyzing trace with hash 236134947, now seen corresponding path program 2 times [2022-07-23 14:28:59,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:59,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987390178] [2022-07-23 14:28:59,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:59,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:59,428 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:59,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:59,775 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:28:59,776 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:28:59,776 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:28:59,776 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:28:59,776 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:28:59,776 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:59,776 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:28:59,776 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:28:59,776 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration2_Lasso [2022-07-23 14:28:59,776 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:28:59,777 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:28:59,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:59,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:59,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:59,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:59,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:59,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:59,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:59,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:59,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:59,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:59,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:59,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:59,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:59,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:59,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:59,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:29:00,188 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:29:00,190 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:29:00,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:00,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:00,193 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) [2022-07-23 14:29:00,193 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 [2022-07-23 14:29:00,194 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 [2022-07-23 14:29:00,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:29:00,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:29:00,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:29:00,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:29:00,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:29:00,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:29:00,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:29:00,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:29:00,219 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 [2022-07-23 14:29:00,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:00,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:00,220 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) [2022-07-23 14:29:00,221 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 [2022-07-23 14:29:00,222 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 [2022-07-23 14:29:00,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:29:00,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:29:00,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:29:00,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:29:00,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:29:00,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:29:00,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:29:00,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:29:00,256 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 [2022-07-23 14:29:00,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:00,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:00,257 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) [2022-07-23 14:29:00,258 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 [2022-07-23 14:29:00,259 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 [2022-07-23 14:29:00,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:29:00,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:29:00,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:29:00,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:29:00,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:29:00,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:29:00,287 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:29:00,307 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 [2022-07-23 14:29:00,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:00,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:00,308 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) [2022-07-23 14:29:00,309 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 [2022-07-23 14:29:00,310 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 [2022-07-23 14:29:00,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:29:00,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:29:00,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:29:00,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:29:00,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:29:00,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:29:00,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:29:00,343 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 [2022-07-23 14:29:00,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:00,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:00,344 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) [2022-07-23 14:29:00,345 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 [2022-07-23 14:29:00,346 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 [2022-07-23 14:29:00,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:29:00,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:29:00,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:29:00,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:29:00,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:29:00,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:29:00,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:29:00,392 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 [2022-07-23 14:29:00,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:00,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:00,393 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) [2022-07-23 14:29:00,394 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 [2022-07-23 14:29:00,395 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 [2022-07-23 14:29:00,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:29:00,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:29:00,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:29:00,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:29:00,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:29:00,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:29:00,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:29:00,440 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 [2022-07-23 14:29:00,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:00,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:00,441 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) [2022-07-23 14:29:00,442 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 [2022-07-23 14:29:00,444 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 [2022-07-23 14:29:00,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:29:00,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:29:00,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:29:00,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:29:00,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:29:00,453 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:29:00,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:29:00,480 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 [2022-07-23 14:29:00,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:00,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:00,481 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) [2022-07-23 14:29:00,482 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 [2022-07-23 14:29:00,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:29:00,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:29:00,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:29:00,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:29:00,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:29:00,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:29:00,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:29:00,506 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:29:00,518 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-23 14:29:00,519 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-07-23 14:29:00,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:00,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:00,521 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) [2022-07-23 14:29:00,522 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 [2022-07-23 14:29:00,523 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:29:00,544 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:29:00,544 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:29:00,545 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 + 19 Supporting invariants [] [2022-07-23 14:29:00,573 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 [2022-07-23 14:29:00,606 INFO L293 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2022-07-23 14:29:00,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:29:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:29:00,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:29:00,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:29:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:29:00,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 14:29:00,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:29:00,690 INFO L390 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 0 case distinctions, treesize of input 32 treesize of output 20 [2022-07-23 14:29:00,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:29:00,704 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 14:29:00,705 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2022-07-23 14:29:00,735 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 17 states and 20 transitions. Complement of second has 6 states. [2022-07-23 14:29:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 14:29:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2022-07-23 14:29:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-07-23 14:29:00,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2022-07-23 14:29:00,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:29:00,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2022-07-23 14:29:00,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:29:00,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2022-07-23 14:29:00,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:29:00,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2022-07-23 14:29:00,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:29:00,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2022-07-23 14:29:00,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-23 14:29:00,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-07-23 14:29:00,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2022-07-23 14:29:00,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:29:00,746 INFO L369 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-23 14:29:00,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2022-07-23 14:29:00,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-07-23 14:29:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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) [2022-07-23 14:29:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-07-23 14:29:00,748 INFO L392 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-23 14:29:00,748 INFO L374 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-23 14:29:00,748 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 14:29:00,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-07-23 14:29:00,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:29:00,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:29:00,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:29:00,750 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2022-07-23 14:29:00,750 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 14:29:00,750 INFO L752 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 159#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~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_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 162#L552-3 goto; 169#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 168#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 167#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 166#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 160#L552-1 [2022-07-23 14:29:00,750 INFO L754 eck$LassoCheckResult]: Loop: 160#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 163#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 154#L552-3 goto; 155#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 160#L552-1 [2022-07-23 14:29:00,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:29:00,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1805830304, now seen corresponding path program 3 times [2022-07-23 14:29:00,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:29:00,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534683140] [2022-07-23 14:29:00,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:29:00,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:29:00,806 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 [2022-07-23 14:29:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:29:00,814 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:29:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:29:00,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:29:00,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:29:00,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 2 times [2022-07-23 14:29:00,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:29:00,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878620766] [2022-07-23 14:29:00,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:29:00,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:29:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:29:00,837 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:29:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:29:00,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:29:00,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:29:00,841 INFO L85 PathProgramCache]: Analyzing trace with hash -707580506, now seen corresponding path program 1 times [2022-07-23 14:29:00,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:29:00,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426178628] [2022-07-23 14:29:00,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:29:00,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:29:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:29:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:29:00,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:29:00,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426178628] [2022-07-23 14:29:00,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426178628] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:29:00,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750502419] [2022-07-23 14:29:00,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:29:00,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:29:00,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:00,924 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:29:00,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-23 14:29:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:29:00,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-23 14:29:00,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:29:01,011 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-23 14:29:01,012 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-07-23 14:29:01,029 INFO L356 Elim1Store]: treesize reduction 39, result has 26.4 percent of original size [2022-07-23 14:29:01,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2022-07-23 14:29:01,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-23 14:29:01,077 INFO L390 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 5 [2022-07-23 14:29:01,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:29:01,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 1 [2022-07-23 14:29:01,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2022-07-23 14:29:01,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-23 14:29:01,141 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:29:01,142 INFO L390 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 1 case distinctions, treesize of input 28 treesize of output 26 [2022-07-23 14:29:01,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-23 14:29:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:29:01,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:29:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:29:01,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750502419] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:29:01,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:29:01,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2022-07-23 14:29:01,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649683196] [2022-07-23 14:29:01,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:29:01,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:29:01,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 14:29:01,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-23 14:29:01,284 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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) [2022-07-23 14:29:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:29:01,343 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-07-23 14:29:01,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 14:29:01,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions. [2022-07-23 14:29:01,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:29:01,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 26 transitions. [2022-07-23 14:29:01,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-23 14:29:01,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-23 14:29:01,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2022-07-23 14:29:01,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:29:01,347 INFO L369 hiAutomatonCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-07-23 14:29:01,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2022-07-23 14:29:01,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-23 14:29:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 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) [2022-07-23 14:29:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-07-23 14:29:01,348 INFO L392 hiAutomatonCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-07-23 14:29:01,348 INFO L374 stractBuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-07-23 14:29:01,348 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 14:29:01,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2022-07-23 14:29:01,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:29:01,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:29:01,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:29:01,349 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2022-07-23 14:29:01,349 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 14:29:01,349 INFO L752 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 286#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~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_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 295#L552-3 goto; 304#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 303#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 299#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 291#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 292#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 298#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 293#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 294#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 308#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 307#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 306#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 305#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 301#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 296#L552-1 [2022-07-23 14:29:01,349 INFO L754 eck$LassoCheckResult]: Loop: 296#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 297#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 287#L552-3 goto; 288#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 296#L552-1 [2022-07-23 14:29:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:29:01,350 INFO L85 PathProgramCache]: Analyzing trace with hash 703087812, now seen corresponding path program 4 times [2022-07-23 14:29:01,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:29:01,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642094283] [2022-07-23 14:29:01,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:29:01,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:29:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:29:01,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:29:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:29:01,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:29:01,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:29:01,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 3 times [2022-07-23 14:29:01,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:29:01,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406411617] [2022-07-23 14:29:01,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:29:01,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:29:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:29:01,396 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:29:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:29:01,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:29:01,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:29:01,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1091176502, now seen corresponding path program 2 times [2022-07-23 14:29:01,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:29:01,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571820467] [2022-07-23 14:29:01,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:29:01,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:29:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:29:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:29:01,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:29:01,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571820467] [2022-07-23 14:29:01,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571820467] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:29:01,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388927561] [2022-07-23 14:29:01,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 14:29:01,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:29:01,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:01,566 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:29:01,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-23 14:29:01,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 14:29:01,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:29:01,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-23 14:29:01,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:29:01,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-23 14:29:01,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:29:01,651 INFO L390 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 14 treesize of output 16 [2022-07-23 14:29:01,654 INFO L390 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 [2022-07-23 14:29:01,673 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:01,690 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:01,708 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:01,729 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:01,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-23 14:29:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:29:01,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:29:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:29:01,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388927561] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:29:01,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:29:01,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 25 [2022-07-23 14:29:01,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353657211] [2022-07-23 14:29:01,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:29:01,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:29:01,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-23 14:29:01,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=382, Unknown=0, NotChecked=0, Total=600 [2022-07-23 14:29:01,940 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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) [2022-07-23 14:29:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:29:02,055 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-07-23 14:29:02,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 14:29:02,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 56 transitions. [2022-07-23 14:29:02,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:29:02,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 44 transitions. [2022-07-23 14:29:02,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-23 14:29:02,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-23 14:29:02,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2022-07-23 14:29:02,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:29:02,058 INFO L369 hiAutomatonCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-07-23 14:29:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2022-07-23 14:29:02,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-23 14:29:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:29:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-07-23 14:29:02,060 INFO L392 hiAutomatonCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-07-23 14:29:02,060 INFO L374 stractBuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-07-23 14:29:02,060 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 14:29:02,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2022-07-23 14:29:02,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:29:02,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:29:02,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:29:02,061 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2022-07-23 14:29:02,061 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 14:29:02,061 INFO L752 eck$LassoCheckResult]: Stem: 521#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 522#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~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_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 527#L552-3 goto; 537#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 536#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 531#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 523#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 524#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 558#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 525#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 526#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 530#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 532#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 557#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 556#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 555#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 554#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 553#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 552#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 551#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 550#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 549#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 548#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 547#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 546#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 545#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 544#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 543#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 542#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 541#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 540#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 539#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 538#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 534#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 528#L552-1 [2022-07-23 14:29:02,061 INFO L754 eck$LassoCheckResult]: Loop: 528#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 529#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 517#L552-3 goto; 518#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 528#L552-1 [2022-07-23 14:29:02,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:29:02,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1598657468, now seen corresponding path program 5 times [2022-07-23 14:29:02,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:29:02,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419819598] [2022-07-23 14:29:02,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:29:02,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:29:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:29:02,082 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:29:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:29:02,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:29:02,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:29:02,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 4 times [2022-07-23 14:29:02,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:29:02,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277338496] [2022-07-23 14:29:02,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:29:02,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:29:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:29:02,123 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:29:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:29:02,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:29:02,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:29:02,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1264869194, now seen corresponding path program 3 times [2022-07-23 14:29:02,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:29:02,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537466852] [2022-07-23 14:29:02,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:29:02,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:29:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:29:02,168 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:29:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:29:02,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:29:09,156 WARN L233 SmtUtils]: Spent 6.90s on a formula simplification. DAG size of input: 203 DAG size of output: 165 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-23 14:29:09,279 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:29:09,279 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:29:09,279 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:29:09,279 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:29:09,279 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:29:09,279 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:09,280 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:29:09,280 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:29:09,280 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration5_Lasso [2022-07-23 14:29:09,280 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:29:09,280 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:29:09,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:29:09,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:29:09,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:29:09,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:29:09,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:29:09,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:29:09,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:29:09,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:29:09,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:29:09,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:29:09,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:29:09,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:29:09,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:29:09,681 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:29:09,681 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:29:09,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:09,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:09,728 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) [2022-07-23 14:29:09,729 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 [2022-07-23 14:29:09,730 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 [2022-07-23 14:29:09,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:29:09,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:29:09,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:29:09,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:29:09,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:29:09,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:29:09,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:29:09,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:29:09,787 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 [2022-07-23 14:29:09,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:09,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:09,788 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) [2022-07-23 14:29:09,789 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 [2022-07-23 14:29:09,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:29:09,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:29:09,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:29:09,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:29:09,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:29:09,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:29:09,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:29:09,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:29:09,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:29:09,818 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 [2022-07-23 14:29:09,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:09,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:09,819 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) [2022-07-23 14:29:09,820 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 [2022-07-23 14:29:09,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:29:09,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:29:09,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:29:09,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:29:09,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:29:09,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:29:09,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:29:09,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:29:09,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-23 14:29:09,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:09,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:09,846 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) [2022-07-23 14:29:09,846 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 [2022-07-23 14:29:09,848 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 [2022-07-23 14:29:09,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:29:09,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:29:09,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:29:09,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:29:09,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:29:09,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:29:09,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:29:09,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:29:09,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-23 14:29:09,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:09,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:09,871 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) [2022-07-23 14:29:09,871 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 [2022-07-23 14:29:09,873 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 [2022-07-23 14:29:09,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:29:09,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:29:09,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:29:09,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:29:09,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:29:09,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:29:09,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:29:09,899 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 [2022-07-23 14:29:09,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:09,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:09,900 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) [2022-07-23 14:29:09,901 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 [2022-07-23 14:29:09,902 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 [2022-07-23 14:29:09,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:29:09,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:29:09,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:29:09,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:29:09,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:29:09,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:29:09,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:29:09,934 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 [2022-07-23 14:29:09,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:09,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:09,935 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) [2022-07-23 14:29:09,936 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 [2022-07-23 14:29:09,938 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 [2022-07-23 14:29:09,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:29:09,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:29:09,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:29:09,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:29:09,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:29:09,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:29:09,954 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:29:09,963 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-23 14:29:09,963 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-07-23 14:29:09,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:29:09,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:29:09,965 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) [2022-07-23 14:29:09,973 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 [2022-07-23 14:29:09,973 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:29:09,982 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-23 14:29:09,982 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:29:09,982 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_2) = -11*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_2 + 224 Supporting invariants [-22*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_2 + 23*ULTIMATE.start_main_#t~mem4#1 >= 0] [2022-07-23 14:29:10,002 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 [2022-07-23 14:29:10,024 INFO L293 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2022-07-23 14:29:10,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:29:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:29:10,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-23 14:29:10,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:29:10,095 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-23 14:29:10,095 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-07-23 14:29:10,111 INFO L356 Elim1Store]: treesize reduction 39, result has 26.4 percent of original size [2022-07-23 14:29:10,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2022-07-23 14:29:10,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-23 14:29:10,168 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 [2022-07-23 14:29:10,178 INFO L390 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 5 [2022-07-23 14:29:10,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2022-07-23 14:29:10,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-23 14:29:10,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:29:10,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 1 [2022-07-23 14:29:10,239 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:29:10,240 INFO L390 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 1 case distinctions, treesize of input 28 treesize of output 26 [2022-07-23 14:29:10,262 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:10,285 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:10,309 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:10,331 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:10,355 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:10,393 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:10,422 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:10,456 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:10,487 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:29:10,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 14:29:10,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:29:10,525 INFO L390 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 0 case distinctions, treesize of input 43 treesize of output 27 [2022-07-23 14:29:10,583 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-07-23 14:29:10,584 INFO L390 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 37 treesize of output 48 [2022-07-23 14:29:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:29:10,666 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2022-07-23 14:29:10,666 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:29:10,710 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 44 transitions. Complement of second has 5 states. [2022-07-23 14:29:10,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 0 non-accepting loop states 2 accepting loop states [2022-07-23 14:29:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:29:10,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2022-07-23 14:29:10,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2022-07-23 14:29:10,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:29:10,711 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:29:10,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:29:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:29:10,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-23 14:29:10,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:29:10,787 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-23 14:29:10,787 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-07-23 14:29:10,804 INFO L356 Elim1Store]: treesize reduction 39, result has 26.4 percent of original size [2022-07-23 14:29:10,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2022-07-23 14:29:10,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-23 14:29:10,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-23 14:29:10,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 30 treesize of output 46 [2022-07-23 14:29:10,868 INFO L390 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 0 case distinctions, treesize of input 16 treesize of output 5 [2022-07-23 14:29:10,870 INFO L390 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 5 treesize of output 3 [2022-07-23 14:29:10,894 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:29:10,895 INFO L390 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 1 case distinctions, treesize of input 28 treesize of output 26 [2022-07-23 14:29:10,919 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:10,942 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:10,981 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:11,003 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:11,027 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:11,050 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:11,082 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:11,115 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:11,145 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:29:11,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 14:29:11,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:29:11,187 INFO L390 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 0 case distinctions, treesize of input 43 treesize of output 27 [2022-07-23 14:29:11,245 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-07-23 14:29:11,246 INFO L390 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 37 treesize of output 48 [2022-07-23 14:29:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:29:11,390 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 3 loop predicates [2022-07-23 14:29:11,390 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:29:11,415 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 44 transitions. Complement of second has 4 states. [2022-07-23 14:29:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-23 14:29:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:29:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2022-07-23 14:29:11,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 34 letters. Loop has 4 letters. [2022-07-23 14:29:11,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:29:11,416 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:29:11,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:29:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:29:11,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 14:29:11,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:29:11,492 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-23 14:29:11,492 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-07-23 14:29:11,507 INFO L356 Elim1Store]: treesize reduction 39, result has 26.4 percent of original size [2022-07-23 14:29:11,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2022-07-23 14:29:11,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-23 14:29:11,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-23 14:29:11,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 30 treesize of output 50 [2022-07-23 14:29:11,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 14:29:11,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-23 14:29:11,559 INFO L390 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 0 case distinctions, treesize of input 16 treesize of output 5 [2022-07-23 14:29:11,561 INFO L390 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 5 treesize of output 3 [2022-07-23 14:29:11,583 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:29:11,583 INFO L390 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 1 case distinctions, treesize of input 28 treesize of output 26 [2022-07-23 14:29:11,606 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:29:11,606 INFO L390 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 1 case distinctions, treesize of input 28 treesize of output 26 [2022-07-23 14:29:11,632 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:11,653 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:11,684 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:11,712 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:11,742 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:11,771 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:11,820 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:11,853 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:29:11,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 14:29:11,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:29:11,891 INFO L390 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 0 case distinctions, treesize of input 43 treesize of output 27 [2022-07-23 14:29:11,963 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-07-23 14:29:11,963 INFO L390 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 37 treesize of output 48 [2022-07-23 14:29:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:29:12,057 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2022-07-23 14:29:12,057 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:29:12,260 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 44 transitions. Complement of second has 33 states. [2022-07-23 14:29:12,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 12 stem states 0 non-accepting loop states 2 accepting loop states [2022-07-23 14:29:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:29:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-07-23 14:29:12,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 34 letters. Loop has 4 letters. [2022-07-23 14:29:12,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:29:12,262 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:29:12,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:29:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:29:12,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 14:29:12,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:29:12,332 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-23 14:29:12,332 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-07-23 14:29:12,345 INFO L356 Elim1Store]: treesize reduction 39, result has 26.4 percent of original size [2022-07-23 14:29:12,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2022-07-23 14:29:12,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-23 14:29:12,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-23 14:29:12,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 25 treesize of output 41 [2022-07-23 14:29:12,413 INFO L390 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 0 case distinctions, treesize of input 67 treesize of output 43 [2022-07-23 14:29:12,417 INFO L390 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 5 treesize of output 3 [2022-07-23 14:29:12,440 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:29:12,440 INFO L390 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 1 case distinctions, treesize of input 28 treesize of output 26 [2022-07-23 14:29:12,459 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:12,485 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:12,517 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:12,542 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:12,574 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:12,606 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:12,631 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:12,662 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:12,698 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:29:12,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 14:29:12,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:29:12,736 INFO L390 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 0 case distinctions, treesize of input 43 treesize of output 27 [2022-07-23 14:29:12,788 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-07-23 14:29:12,789 INFO L390 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 37 treesize of output 48 [2022-07-23 14:29:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:29:12,881 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.12 stem predicates 3 loop predicates [2022-07-23 14:29:12,881 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:29:13,061 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 44 transitions. Complement of second has 23 states. [2022-07-23 14:29:13,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 12 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-23 14:29:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:29:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2022-07-23 14:29:13,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 48 transitions. Stem has 34 letters. Loop has 4 letters. [2022-07-23 14:29:13,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:29:13,063 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:29:13,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:29:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:29:13,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-23 14:29:13,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:29:13,134 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-23 14:29:13,134 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-07-23 14:29:13,148 INFO L356 Elim1Store]: treesize reduction 39, result has 26.4 percent of original size [2022-07-23 14:29:13,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2022-07-23 14:29:13,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-23 14:29:13,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-23 14:29:13,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 30 treesize of output 50 [2022-07-23 14:29:13,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 14:29:13,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-23 14:29:13,243 INFO L390 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 0 case distinctions, treesize of input 16 treesize of output 5 [2022-07-23 14:29:13,245 INFO L390 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 5 treesize of output 3 [2022-07-23 14:29:13,277 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:29:13,278 INFO L390 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 1 case distinctions, treesize of input 28 treesize of output 26 [2022-07-23 14:29:13,303 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:13,325 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:13,352 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:13,375 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:13,402 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:13,429 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:13,457 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:13,485 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:13,514 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:29:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:29:13,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 14:29:13,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:29:13,549 INFO L390 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 0 case distinctions, treesize of input 43 treesize of output 27 [2022-07-23 14:29:13,598 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-07-23 14:29:13,598 INFO L390 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 37 treesize of output 48 [2022-07-23 14:29:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:29:13,684 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2022-07-23 14:29:13,685 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:29:13,915 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 149 states and 200 transitions. Complement of second has 70 states 25 powerset states45 rank states. The highest rank that occured is 1 [2022-07-23 14:29:13,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 12 stem states 0 non-accepting loop states 2 accepting loop states [2022-07-23 14:29:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:29:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 75 transitions. [2022-07-23 14:29:13,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 75 transitions. Stem has 34 letters. Loop has 4 letters. [2022-07-23 14:29:13,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:29:13,917 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:29:13,917 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.cegar.BuchiAutomatonCegarLoop.refineBuchi(BuchiAutomatonCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineBuchi(BuchiAutomatonCegarLoop.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.refineBuchiAndReportRankingFunction(AbstractBuchiCegarLoop.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:358) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) 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) [2022-07-23 14:29:13,920 INFO L158 Benchmark]: Toolchain (without parser) took 15716.60ms. Allocated memory was 96.5MB in the beginning and 157.3MB in the end (delta: 60.8MB). Free memory was 56.9MB in the beginning and 109.6MB in the end (delta: -52.7MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2022-07-23 14:29:13,920 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 74.7MB in the beginning and 74.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:29:13,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.48ms. Allocated memory is still 96.5MB. Free memory was 56.8MB in the beginning and 65.8MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 14:29:13,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.59ms. Allocated memory is still 96.5MB. Free memory was 65.8MB in the beginning and 64.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:29:13,921 INFO L158 Benchmark]: Boogie Preprocessor took 12.55ms. Allocated memory is still 96.5MB. Free memory was 64.2MB in the beginning and 62.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:29:13,921 INFO L158 Benchmark]: RCFGBuilder took 264.21ms. Allocated memory is still 96.5MB. Free memory was 62.9MB in the beginning and 52.8MB in the end (delta: 10.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-23 14:29:13,921 INFO L158 Benchmark]: BuchiAutomizer took 15122.59ms. Allocated memory was 96.5MB in the beginning and 157.3MB in the end (delta: 60.8MB). Free memory was 52.8MB in the beginning and 109.6MB in the end (delta: -56.8MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2022-07-23 14:29:13,922 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.15ms. Allocated memory is still 96.5MB. Free memory was 74.7MB in the beginning and 74.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.48ms. Allocated memory is still 96.5MB. Free memory was 56.8MB in the beginning and 65.8MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.59ms. Allocated memory is still 96.5MB. Free memory was 65.8MB in the beginning and 64.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.55ms. Allocated memory is still 96.5MB. Free memory was 64.2MB in the beginning and 62.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 264.21ms. Allocated memory is still 96.5MB. Free memory was 62.9MB in the beginning and 52.8MB in the end (delta: 10.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 15122.59ms. Allocated memory was 96.5MB in the beginning and 157.3MB in the end (delta: 60.8MB). Free memory was 52.8MB in the beginning and 109.6MB in the end (delta: -56.8MB). Peak memory consumption was 4.9MB. 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.cegar.BuchiAutomatonCegarLoop.refineBuchi(BuchiAutomatonCegarLoop.java:325) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-23 14:29:13,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-23 14:29:14,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-23 14:29:14,356 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