./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/max05-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/reducercommutativity/max05-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4e48915cf0eaefe43320bbe59bf88f5c68b2f305d293e808fa6ece9112b5c238 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:34:08,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:34:08,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:34:08,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:34:08,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:34:08,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:34:08,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:34:08,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:34:08,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:34:08,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:34:08,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:34:08,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:34:08,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:34:08,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:34:08,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:34:08,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:34:08,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:34:08,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:34:08,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:34:08,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:34:08,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:34:08,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:34:08,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:34:08,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:34:08,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:34:08,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:34:08,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:34:08,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:34:08,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:34:08,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:34:08,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:34:08,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:34:08,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:34:08,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:34:08,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:34:08,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:34:08,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:34:08,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:34:08,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:34:08,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:34:08,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:34:08,585 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:34:08,622 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:34:08,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:34:08,623 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:34:08,623 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:34:08,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:34:08,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:34:08,624 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:34:08,625 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:34:08,625 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:34:08,625 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:34:08,626 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:34:08,626 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:34:08,626 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:34:08,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:34:08,627 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:34:08,627 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:34:08,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:34:08,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:34:08,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:34:08,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:34:08,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:34:08,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:34:08,628 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:34:08,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:34:08,628 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:34:08,628 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:34:08,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:34:08,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:34:08,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:34:08,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:34:08,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:34:08,630 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:34:08,630 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4e48915cf0eaefe43320bbe59bf88f5c68b2f305d293e808fa6ece9112b5c238 [2022-02-21 04:34:08,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:34:08,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:34:08,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:34:08,914 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:34:08,915 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:34:08,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max05-1.i [2022-02-21 04:34:08,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c2c1b37d/ab391eebf0ea40ad9a0dde17591ad43e/FLAG3ab51bccd [2022-02-21 04:34:09,361 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:34:09,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i [2022-02-21 04:34:09,367 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c2c1b37d/ab391eebf0ea40ad9a0dde17591ad43e/FLAG3ab51bccd [2022-02-21 04:34:09,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c2c1b37d/ab391eebf0ea40ad9a0dde17591ad43e [2022-02-21 04:34:09,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:34:09,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:34:09,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:09,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:34:09,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:34:09,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:09" (1/1) ... [2022-02-21 04:34:09,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35acfcdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:09, skipping insertion in model container [2022-02-21 04:34:09,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:09" (1/1) ... [2022-02-21 04:34:09,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:34:09,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:34:09,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i[1284,1297] [2022-02-21 04:34:09,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:09,593 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:34:09,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i[1284,1297] [2022-02-21 04:34:09,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:09,653 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:34:09,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:09 WrapperNode [2022-02-21 04:34:09,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:09,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:09,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:34:09,658 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:34:09,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:09" (1/1) ... [2022-02-21 04:34:09,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:09" (1/1) ... [2022-02-21 04:34:09,719 INFO L137 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-02-21 04:34:09,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:09,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:34:09,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:34:09,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:34:09,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:09" (1/1) ... [2022-02-21 04:34:09,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:09" (1/1) ... [2022-02-21 04:34:09,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:09" (1/1) ... [2022-02-21 04:34:09,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:09" (1/1) ... [2022-02-21 04:34:09,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:09" (1/1) ... [2022-02-21 04:34:09,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:09" (1/1) ... [2022-02-21 04:34:09,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:09" (1/1) ... [2022-02-21 04:34:09,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:34:09,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:34:09,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:34:09,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:34:09,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:09" (1/1) ... [2022-02-21 04:34:09,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:09,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:09,795 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-02-21 04:34:09,797 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-02-21 04:34:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:34:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:34:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:34:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:34:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:34:09,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:34:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:34:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:34:09,879 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:34:09,880 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:34:10,201 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:34:10,211 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:34:10,212 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-21 04:34:10,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:10 BoogieIcfgContainer [2022-02-21 04:34:10,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:34:10,214 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:34:10,214 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:34:10,218 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:34:10,219 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:10,219 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:34:09" (1/3) ... [2022-02-21 04:34:10,220 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43e4cd6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:34:10, skipping insertion in model container [2022-02-21 04:34:10,220 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:10,220 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:09" (2/3) ... [2022-02-21 04:34:10,220 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43e4cd6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:34:10, skipping insertion in model container [2022-02-21 04:34:10,220 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:10,220 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:10" (3/3) ... [2022-02-21 04:34:10,221 INFO L388 chiAutomizerObserver]: Analyzing ICFG max05-1.i [2022-02-21 04:34:10,258 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:34:10,258 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:34:10,259 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:34:10,259 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:34:10,259 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:34:10,259 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:34:10,259 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:34:10,259 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:34:10,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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-02-21 04:34:10,298 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2022-02-21 04:34:10,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:10,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:10,305 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 04:34:10,306 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:10,306 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:34:10,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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-02-21 04:34:10,312 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2022-02-21 04:34:10,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:10,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:10,315 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 04:34:10,316 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:10,321 INFO L791 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 17#L34-3true [2022-02-21 04:34:10,322 INFO L793 eck$LassoCheckResult]: Loop: 17#L34-3true assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 11#L34-2true main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17#L34-3true [2022-02-21 04:34:10,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:10,333 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 04:34:10,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:10,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629626705] [2022-02-21 04:34:10,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:10,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:10,449 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:10,486 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:10,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-02-21 04:34:10,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:10,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233088460] [2022-02-21 04:34:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:10,500 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:10,510 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:10,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:10,512 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 04:34:10,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:10,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709795982] [2022-02-21 04:34:10,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:10,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:10,538 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:10,556 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:10,866 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:10,867 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:10,868 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:10,868 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:10,868 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:10,868 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:10,868 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:10,869 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:10,869 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration1_Lasso [2022-02-21 04:34:10,869 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:10,869 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:10,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:10,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:10,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:10,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:10,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:10,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:11,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:11,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:11,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:11,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:11,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:11,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:11,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:11,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:11,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:11,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:11,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:11,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:11,530 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:34:11,534 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:34:11,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:11,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:11,540 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-02-21 04:34:11,546 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-02-21 04:34:11,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:11,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:11,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:11,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:11,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:11,559 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-02-21 04:34:11,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:11,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:11,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:11,591 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-02-21 04:34:11,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:11,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:11,593 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-02-21 04:34:11,593 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-02-21 04:34:11,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:11,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:11,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:11,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:11,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:11,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:11,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:11,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:11,625 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:11,641 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-02-21 04:34:11,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:11,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:11,643 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-02-21 04:34:11,643 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-02-21 04:34:11,645 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-02-21 04:34:11,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:11,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:11,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:11,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:11,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:11,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:11,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:11,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:11,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 04:34:11,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:11,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:11,676 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-02-21 04:34:11,677 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-02-21 04:34:11,678 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-02-21 04:34:11,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:11,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:11,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:11,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:11,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:11,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:11,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:11,735 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-02-21 04:34:11,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:11,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:11,737 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-02-21 04:34:11,739 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-02-21 04:34:11,740 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-02-21 04:34:11,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:11,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:11,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:11,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:11,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:11,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:11,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:11,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:11,786 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-02-21 04:34:11,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:11,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:11,787 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-02-21 04:34:11,788 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-02-21 04:34:11,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-02-21 04:34:11,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:11,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:11,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:11,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:11,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:11,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:11,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:11,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 04:34:11,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:11,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:11,835 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-02-21 04:34:11,839 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-02-21 04:34:11,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:11,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:11,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:11,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:11,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:11,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:11,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:11,869 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:11,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:11,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:11,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:11,896 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-02-21 04:34:11,900 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-02-21 04:34:11,900 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-02-21 04:34:11,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:11,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:11,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:11,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:11,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:11,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:11,939 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:34:11,964 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 04:34:11,964 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-02-21 04:34:11,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:11,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:11,968 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-02-21 04:34:11,968 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-02-21 04:34:12,004 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:34:12,025 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:34:12,026 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:34:12,026 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1) = -2*ULTIMATE.start_main_~i~1#1 + 9 Supporting invariants [] [2022-02-21 04:34:12,051 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-02-21 04:34:12,077 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-02-21 04:34:12,083 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1;" "main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2022-02-21 04:34:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:12,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:12,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:34:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:12,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:12,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {41#unseeded} is VALID [2022-02-21 04:34:12,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {41#unseeded} is VALID [2022-02-21 04:34:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:12,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:34:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:12,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:12,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#(>= oldRank0 (+ 9 (* (- 2) |ULTIMATE.start_main_~i~1#1|)))} assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; {87#(and (>= oldRank0 (+ 9 (* (- 2) |ULTIMATE.start_main_~i~1#1|))) (< |ULTIMATE.start_main_~i~1#1| 5))} is VALID [2022-02-21 04:34:12,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {87#(and (>= oldRank0 (+ 9 (* (- 2) |ULTIMATE.start_main_~i~1#1|))) (< |ULTIMATE.start_main_~i~1#1| 5))} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {79#(or (and (>= oldRank0 0) (> oldRank0 (+ 9 (* (- 2) |ULTIMATE.start_main_~i~1#1|)))) unseeded)} is VALID [2022-02-21 04:34:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:12,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-02-21 04:34:12,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:12,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:12,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,229 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-02-21 04:34:12,231 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-02-21 04:34:12,401 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 87 states and 122 transitions. Complement of second has 7 states. [2022-02-21 04:34:12,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:34:12,402 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:12,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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-02-21 04:34:12,407 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2022-02-21 04:34:12,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:12,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:12,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-02-21 04:34:12,408 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-02-21 04:34:12,417 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:34:12,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:12,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:12,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 122 transitions. [2022-02-21 04:34:12,426 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-02-21 04:34:12,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:12,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:12,428 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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-02-21 04:34:12,431 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2022-02-21 04:34:12,434 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2022-02-21 04:34:12,434 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-02-21 04:34:12,438 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:34:12,438 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:34:12,439 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 87 states and 122 transitions. cyclomatic complexity: 48 [2022-02-21 04:34:12,441 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 04:34:12,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:12,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:12,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:12,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:12,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:12,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:12,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:12,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:12,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:12,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 87 letters. Loop has 87 letters. [2022-02-21 04:34:12,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 87 letters. Loop has 87 letters. [2022-02-21 04:34:12,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 87 letters. Loop has 87 letters. [2022-02-21 04:34:12,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 31 letters. Loop has 31 letters. [2022-02-21 04:34:12,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 31 letters. Loop has 31 letters. [2022-02-21 04:34:12,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 31 letters. Loop has 31 letters. [2022-02-21 04:34:12,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:12,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:12,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:12,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:34:12,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:34:12,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:34:12,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:34:12,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:34:12,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:34:12,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:34:12,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:34:12,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:34:12,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:34:12,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:34:12,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:34:12,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:34:12,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:34:12,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:34:12,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:12,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:12,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:12,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:34:12,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:34:12,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:34:12,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:34:12,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:34:12,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:34:12,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 04:34:12,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 04:34:12,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 10 letters. Loop has 4 letters. [2022-02-21 04:34:12,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:34:12,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:34:12,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:34:12,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:12,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:12,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:12,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:34:12,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:34:12,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:34:12,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:34:12,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:34:12,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:34:12,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:34:12,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:34:12,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:34:12,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:12,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:12,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:12,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:34:12,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:34:12,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:34:12,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:12,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:12,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:12,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:12,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:12,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:12,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:34:12,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:34:12,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:34:12,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:34:12,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:34:12,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:34:12,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:34:12,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:34:12,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:34:12,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:34:12,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:34:12,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:34:12,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:12,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:12,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:34:12,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:34:12,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:34:12,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:34:12,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:34:12,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:34:12,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:34:12,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 04:34:12,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 04:34:12,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 10 letters. Loop has 4 letters. [2022-02-21 04:34:12,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:34:12,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:34:12,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:34:12,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:34:12,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:34:12,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:34:12,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:34:12,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:34:12,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:34:12,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:34:12,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:34:12,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:34:12,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:34:12,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:34:12,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:34:12,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:12,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:12,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 122 transitions. cyclomatic complexity: 48 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:12,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,496 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-02-21 04:34:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-02-21 04:34:12,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:12,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:12,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 04:34:12,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:12,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 122 transitions. cyclomatic complexity: 48 [2022-02-21 04:34:12,515 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-02-21 04:34:12,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 25 states and 33 transitions. [2022-02-21 04:34:12,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-02-21 04:34:12,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-02-21 04:34:12,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2022-02-21 04:34:12,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:12,523 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-21 04:34:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2022-02-21 04:34:12,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-21 04:34:12,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:12,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:12,544 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:12,545 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:12,548 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-21 04:34:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-21 04:34:12,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:12,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:12,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states and 33 transitions. [2022-02-21 04:34:12,550 INFO L87 Difference]: Start difference. First operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states and 33 transitions. [2022-02-21 04:34:12,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:12,551 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-21 04:34:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-21 04:34:12,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:12,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:12,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:12,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-21 04:34:12,554 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-21 04:34:12,554 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-21 04:34:12,554 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:34:12,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2022-02-21 04:34:12,555 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-02-21 04:34:12,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:12,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:12,555 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:34:12,556 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:34:12,556 INFO L791 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 201#L34-3 assume !(main_~i~1#1 < 5); 194#L34-4 assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 195#L20-3 [2022-02-21 04:34:12,556 INFO L793 eck$LassoCheckResult]: Loop: 195#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 209#L21 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 210#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 208#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 195#L20-3 [2022-02-21 04:34:12,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:12,557 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-02-21 04:34:12,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:12,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607983611] [2022-02-21 04:34:12,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:12,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:12,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {266#true} is VALID [2022-02-21 04:34:12,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {268#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:34:12,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {268#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(main_~i~1#1 < 5); {267#false} is VALID [2022-02-21 04:34:12,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {267#false} assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; {267#false} is VALID [2022-02-21 04:34:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:12,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:34:12,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607983611] [2022-02-21 04:34:12,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607983611] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:34:12,596 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:34:12,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:34:12,597 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563275481] [2022-02-21 04:34:12,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:34:12,599 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:34:12,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:12,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2022-02-21 04:34:12,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:12,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240314463] [2022-02-21 04:34:12,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:12,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:12,609 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:12,615 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:12,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:34:12,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:34:12,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:34:12,671 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-02-21 04:34:12,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:12,708 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-02-21 04:34:12,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:34:12,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-02-21 04:34:12,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:12,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2022-02-21 04:34:12,714 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-02-21 04:34:12,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2022-02-21 04:34:12,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-02-21 04:34:12,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-02-21 04:34:12,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2022-02-21 04:34:12,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:12,716 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-02-21 04:34:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2022-02-21 04:34:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-02-21 04:34:12,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:12,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 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-02-21 04:34:12,717 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 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-02-21 04:34:12,718 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 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-02-21 04:34:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:12,719 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-02-21 04:34:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-02-21 04:34:12,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:12,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:12,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 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 26 states and 33 transitions. [2022-02-21 04:34:12,720 INFO L87 Difference]: Start difference. First operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 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 26 states and 33 transitions. [2022-02-21 04:34:12,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:12,721 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-02-21 04:34:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-02-21 04:34:12,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:12,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:12,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:12,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 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-02-21 04:34:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-21 04:34:12,723 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-21 04:34:12,723 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-21 04:34:12,723 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:34:12,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2022-02-21 04:34:12,723 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-02-21 04:34:12,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:12,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:12,724 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:34:12,724 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:34:12,724 INFO L791 eck$LassoCheckResult]: Stem: 299#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 300#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 310#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 313#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 314#L34-3 assume !(main_~i~1#1 < 5); 303#L34-4 assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 304#L20-3 [2022-02-21 04:34:12,724 INFO L793 eck$LassoCheckResult]: Loop: 304#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 317#L21 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 318#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 319#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 304#L20-3 [2022-02-21 04:34:12,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:12,725 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2022-02-21 04:34:12,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:12,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074500920] [2022-02-21 04:34:12,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:12,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:12,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {377#true} is VALID [2022-02-21 04:34:12,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {379#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:34:12,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; {379#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:34:12,759 INFO L290 TraceCheckUtils]: 3: Hoare triple {379#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {380#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:34:12,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {380#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < 5); {378#false} is VALID [2022-02-21 04:34:12,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#false} assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; {378#false} is VALID [2022-02-21 04:34:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:12,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:34:12,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074500920] [2022-02-21 04:34:12,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074500920] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:34:12,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096317026] [2022-02-21 04:34:12,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:12,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:34:12,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:12,762 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-02-21 04:34:12,787 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-02-21 04:34:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:12,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 04:34:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:12,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:12,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {377#true} is VALID [2022-02-21 04:34:12,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {387#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:34:12,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {387#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; {387#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:34:12,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {387#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {380#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:34:12,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {380#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < 5); {378#false} is VALID [2022-02-21 04:34:12,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#false} assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; {378#false} is VALID [2022-02-21 04:34:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:12,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:34:12,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#false} assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; {378#false} is VALID [2022-02-21 04:34:12,901 INFO L290 TraceCheckUtils]: 4: Hoare triple {403#(< |ULTIMATE.start_main_~i~1#1| 5)} assume !(main_~i~1#1 < 5); {378#false} is VALID [2022-02-21 04:34:12,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {407#(< |ULTIMATE.start_main_~i~1#1| 4)} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {403#(< |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-21 04:34:12,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {407#(< |ULTIMATE.start_main_~i~1#1| 4)} assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; {407#(< |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-21 04:34:12,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {407#(< |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-21 04:34:12,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {377#true} is VALID [2022-02-21 04:34:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:12,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096317026] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:34:12,904 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:34:12,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 04:34:12,904 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779076620] [2022-02-21 04:34:12,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:34:12,905 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:34:12,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:12,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2022-02-21 04:34:12,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:12,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726935791] [2022-02-21 04:34:12,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:12,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:12,913 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:12,919 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:12,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:34:12,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 04:34:12,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-21 04:34:12,972 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:13,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:13,043 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-21 04:34:13,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:34:13,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:13,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:13,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2022-02-21 04:34:13,063 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-02-21 04:34:13,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. [2022-02-21 04:34:13,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-02-21 04:34:13,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-02-21 04:34:13,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2022-02-21 04:34:13,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:13,064 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-02-21 04:34:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2022-02-21 04:34:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-21 04:34:13,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:13,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 38 transitions. Second operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 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-02-21 04:34:13,068 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 38 transitions. Second operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 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-02-21 04:34:13,068 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 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-02-21 04:34:13,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:13,069 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-21 04:34:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-21 04:34:13,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:13,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:13,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states and 38 transitions. [2022-02-21 04:34:13,094 INFO L87 Difference]: Start difference. First operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states and 38 transitions. [2022-02-21 04:34:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:13,097 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-21 04:34:13,097 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-21 04:34:13,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:13,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:13,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:13,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 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-02-21 04:34:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-02-21 04:34:13,101 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-02-21 04:34:13,101 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-02-21 04:34:13,101 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:34:13,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2022-02-21 04:34:13,102 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-02-21 04:34:13,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:13,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:13,105 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2022-02-21 04:34:13,105 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:34:13,106 INFO L791 eck$LassoCheckResult]: Stem: 449#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 450#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 460#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 463#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 464#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 472#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 477#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 476#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 475#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 474#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 473#L34-3 assume !(main_~i~1#1 < 5); 453#L34-4 assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 454#L20-3 [2022-02-21 04:34:13,106 INFO L793 eck$LassoCheckResult]: Loop: 454#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 467#L21 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 468#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 469#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 454#L20-3 [2022-02-21 04:34:13,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:13,107 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2022-02-21 04:34:13,107 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:13,107 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349740063] [2022-02-21 04:34:13,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:13,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:13,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {543#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {543#true} is VALID [2022-02-21 04:34:13,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {543#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {545#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:34:13,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {545#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; {545#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:34:13,211 INFO L290 TraceCheckUtils]: 3: Hoare triple {545#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {546#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:34:13,211 INFO L290 TraceCheckUtils]: 4: Hoare triple {546#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; {546#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:34:13,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {546#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {547#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-21 04:34:13,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {547#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; {547#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-21 04:34:13,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#(<= |ULTIMATE.start_main_~i~1#1| 2)} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {548#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-21 04:34:13,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {548#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; {548#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-21 04:34:13,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {548#(<= |ULTIMATE.start_main_~i~1#1| 3)} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {549#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-21 04:34:13,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {549#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !(main_~i~1#1 < 5); {544#false} is VALID [2022-02-21 04:34:13,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#false} assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; {544#false} is VALID [2022-02-21 04:34:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:13,214 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:34:13,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349740063] [2022-02-21 04:34:13,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349740063] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:34:13,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455767636] [2022-02-21 04:34:13,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 04:34:13,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:34:13,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:13,220 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-02-21 04:34:13,222 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-02-21 04:34:13,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 04:34:13,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 04:34:13,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:34:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:13,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:13,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {543#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {543#true} is VALID [2022-02-21 04:34:13,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {543#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {556#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:34:13,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; {556#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:34:13,381 INFO L290 TraceCheckUtils]: 3: Hoare triple {556#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {546#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:34:13,381 INFO L290 TraceCheckUtils]: 4: Hoare triple {546#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; {546#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:34:13,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {546#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {547#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-21 04:34:13,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {547#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; {547#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-21 04:34:13,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#(<= |ULTIMATE.start_main_~i~1#1| 2)} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {548#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-21 04:34:13,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {548#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; {548#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-21 04:34:13,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {548#(<= |ULTIMATE.start_main_~i~1#1| 3)} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {549#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-21 04:34:13,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {549#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !(main_~i~1#1 < 5); {544#false} is VALID [2022-02-21 04:34:13,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#false} assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; {544#false} is VALID [2022-02-21 04:34:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:13,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:34:13,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#false} assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; {544#false} is VALID [2022-02-21 04:34:13,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {549#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !(main_~i~1#1 < 5); {544#false} is VALID [2022-02-21 04:34:13,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {548#(<= |ULTIMATE.start_main_~i~1#1| 3)} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {549#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-21 04:34:13,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {548#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; {548#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-21 04:34:13,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#(<= |ULTIMATE.start_main_~i~1#1| 2)} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {548#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-21 04:34:13,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {547#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; {547#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-21 04:34:13,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {546#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {547#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-21 04:34:13,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {546#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; {546#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:34:13,483 INFO L290 TraceCheckUtils]: 3: Hoare triple {556#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {546#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-21 04:34:13,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; {556#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:34:13,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {543#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; {556#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-21 04:34:13,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {543#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {543#true} is VALID [2022-02-21 04:34:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:13,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455767636] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:34:13,485 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:34:13,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-02-21 04:34:13,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233733845] [2022-02-21 04:34:13,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:34:13,486 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:34:13,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:13,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2022-02-21 04:34:13,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:13,487 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142028738] [2022-02-21 04:34:13,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:13,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:13,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:13,502 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:13,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:34:13,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 04:34:13,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 04:34:13,555 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:13,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:13,668 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-02-21 04:34:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:34:13,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:13,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:13,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2022-02-21 04:34:13,684 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-02-21 04:34:13,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2022-02-21 04:34:13,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-02-21 04:34:13,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-02-21 04:34:13,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2022-02-21 04:34:13,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:13,685 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-02-21 04:34:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2022-02-21 04:34:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-21 04:34:13,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:13,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 40 transitions. Second operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 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-02-21 04:34:13,687 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 40 transitions. Second operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 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-02-21 04:34:13,687 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 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-02-21 04:34:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:13,688 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-02-21 04:34:13,688 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-02-21 04:34:13,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:13,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:13,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 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 33 states and 40 transitions. [2022-02-21 04:34:13,689 INFO L87 Difference]: Start difference. First operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 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 33 states and 40 transitions. [2022-02-21 04:34:13,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:13,690 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-02-21 04:34:13,690 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-02-21 04:34:13,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:13,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:13,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:13,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 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-02-21 04:34:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-02-21 04:34:13,692 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-02-21 04:34:13,692 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-02-21 04:34:13,692 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:34:13,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2022-02-21 04:34:13,693 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-02-21 04:34:13,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:13,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:13,693 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2022-02-21 04:34:13,693 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:34:13,694 INFO L791 eck$LassoCheckResult]: Stem: 656#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 657#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 665#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 668#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 669#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 677#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 684#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 683#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 682#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 681#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 680#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 679#L34-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 678#L34-3 assume !(main_~i~1#1 < 5); 658#L34-4 assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 659#L20-3 [2022-02-21 04:34:13,694 INFO L793 eck$LassoCheckResult]: Loop: 659#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 672#L21 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 673#L21-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 674#L20-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 659#L20-3 [2022-02-21 04:34:13,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2022-02-21 04:34:13,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:13,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123619633] [2022-02-21 04:34:13,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:13,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:13,729 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:13,753 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:13,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:13,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2022-02-21 04:34:13,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:13,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974431314] [2022-02-21 04:34:13,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:13,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:13,761 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:13,765 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:13,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:13,765 INFO L85 PathProgramCache]: Analyzing trace with hash -743539014, now seen corresponding path program 1 times [2022-02-21 04:34:13,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:13,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929288248] [2022-02-21 04:34:13,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:13,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:13,793 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:13,822 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:14,621 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:14,622 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:14,622 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:14,622 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:14,622 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:14,622 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:14,622 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:14,622 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:14,622 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration5_Lasso [2022-02-21 04:34:14,622 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:14,623 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:14,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:14,784 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_max_~x#1.base) (+ (* ULTIMATE.start_max_~i~0#1 4) ULTIMATE.start_max_~x#1.offset))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 04:34:14,788 INFO L158 Benchmark]: Toolchain (without parser) took 5407.24ms. Allocated memory was 88.1MB in the beginning and 165.7MB in the end (delta: 77.6MB). Free memory was 50.0MB in the beginning and 83.8MB in the end (delta: -33.8MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. [2022-02-21 04:34:14,789 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 88.1MB. Free memory was 66.7MB in the beginning and 66.7MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:34:14,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.40ms. Allocated memory was 88.1MB in the beginning and 123.7MB in the end (delta: 35.7MB). Free memory was 49.8MB in the beginning and 99.1MB in the end (delta: -49.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:34:14,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.92ms. Allocated memory is still 123.7MB. Free memory was 99.1MB in the beginning and 97.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:34:14,790 INFO L158 Benchmark]: Boogie Preprocessor took 44.27ms. Allocated memory is still 123.7MB. Free memory was 97.4MB in the beginning and 95.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:34:14,791 INFO L158 Benchmark]: RCFGBuilder took 448.16ms. Allocated memory is still 123.7MB. Free memory was 95.4MB in the beginning and 78.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-21 04:34:14,791 INFO L158 Benchmark]: BuchiAutomizer took 4572.59ms. Allocated memory was 123.7MB in the beginning and 165.7MB in the end (delta: 41.9MB). Free memory was 77.6MB in the beginning and 83.8MB in the end (delta: -6.1MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2022-02-21 04:34:14,793 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 88.1MB. Free memory was 66.7MB in the beginning and 66.7MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.40ms. Allocated memory was 88.1MB in the beginning and 123.7MB in the end (delta: 35.7MB). Free memory was 49.8MB in the beginning and 99.1MB in the end (delta: -49.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.92ms. Allocated memory is still 123.7MB. Free memory was 99.1MB in the beginning and 97.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.27ms. Allocated memory is still 123.7MB. Free memory was 97.4MB in the beginning and 95.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 448.16ms. Allocated memory is still 123.7MB. Free memory was 95.4MB in the beginning and 78.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 4572.59ms. Allocated memory was 123.7MB in the beginning and 165.7MB in the end (delta: 41.9MB). Free memory was 77.6MB in the beginning and 83.8MB in the end (delta: -6.1MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_max_~x#1.base) (+ (* ULTIMATE.start_max_~i~0#1 4) ULTIMATE.start_max_~x#1.offset))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_max_~x#1.base) (+ (* ULTIMATE.start_max_~i~0#1 4) ULTIMATE.start_max_~x#1.offset))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 04:34:14,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:15,045 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-02-21 04:34:15,245 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*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_max_~x#1.base) (+ (* ULTIMATE.start_max_~i~0#1 4) ULTIMATE.start_max_~x#1.offset))_1 was not added to the transformula!