./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e0a1cec22a7e787a87b4a304bdc1225ca64aedbe71e13dd8a6657fba2c77bbf7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:30:32,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:30:32,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:30:32,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:30:32,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:30:32,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:30:32,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:30:32,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:30:32,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:30:32,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:30:32,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:30:32,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:30:32,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:30:32,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:30:32,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:30:32,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:30:32,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:30:32,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:30:32,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:30:32,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:30:32,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:30:32,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:30:32,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:30:32,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:30:32,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:30:32,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:30:32,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:30:32,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:30:32,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:30:32,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:30:32,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:30:32,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:30:32,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:30:32,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:30:32,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:30:32,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:30:32,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:30:32,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:30:32,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:30:32,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:30:32,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:30:32,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:30:32,226 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:30:32,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:30:32,239 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:30:32,239 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:30:32,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:30:32,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:30:32,241 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:30:32,241 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:30:32,241 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:30:32,241 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:30:32,242 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:30:32,242 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:30:32,242 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:30:32,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:30:32,243 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:30:32,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:30:32,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:30:32,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:30:32,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:30:32,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:30:32,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:30:32,244 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:30:32,244 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:30:32,244 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:30:32,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:30:32,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:30:32,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:30:32,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:30:32,245 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:30:32,245 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0a1cec22a7e787a87b4a304bdc1225ca64aedbe71e13dd8a6657fba2c77bbf7 [2022-02-21 03:30:32,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:30:32,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:30:32,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:30:32,462 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:30:32,462 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:30:32,463 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca.i [2022-02-21 03:30:32,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c99ffbc9/7f7c4935b1a349a8bfb477cc09bf8f33/FLAGc0151ede4 [2022-02-21 03:30:32,958 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:30:32,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca.i [2022-02-21 03:30:32,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c99ffbc9/7f7c4935b1a349a8bfb477cc09bf8f33/FLAGc0151ede4 [2022-02-21 03:30:32,988 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c99ffbc9/7f7c4935b1a349a8bfb477cc09bf8f33 [2022-02-21 03:30:32,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:30:32,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:30:32,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:30:32,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:30:32,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:30:32,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:30:32" (1/1) ... [2022-02-21 03:30:32,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5053c93d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:32, skipping insertion in model container [2022-02-21 03:30:32,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:30:32" (1/1) ... [2022-02-21 03:30:33,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:30:33,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:30:33,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:30:33,292 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:30:33,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:30:33,355 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:30:33,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:33 WrapperNode [2022-02-21 03:30:33,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:30:33,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:30:33,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:30:33,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:30:33,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:33" (1/1) ... [2022-02-21 03:30:33,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:33" (1/1) ... [2022-02-21 03:30:33,391 INFO L137 Inliner]: procedures = 109, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2022-02-21 03:30:33,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:30:33,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:30:33,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:30:33,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:30:33,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:33" (1/1) ... [2022-02-21 03:30:33,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:33" (1/1) ... [2022-02-21 03:30:33,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:33" (1/1) ... [2022-02-21 03:30:33,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:33" (1/1) ... [2022-02-21 03:30:33,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:33" (1/1) ... [2022-02-21 03:30:33,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:33" (1/1) ... [2022-02-21 03:30:33,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:33" (1/1) ... [2022-02-21 03:30:33,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:30:33,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:30:33,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:30:33,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:30:33,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:33" (1/1) ... [2022-02-21 03:30:33,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:33,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:33,447 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 03:30:33,476 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 03:30:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:30:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:30:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:30:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:30:33,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:30:33,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:30:33,554 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:30:33,555 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:30:33,662 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:30:33,666 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:30:33,666 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:30:33,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:30:33 BoogieIcfgContainer [2022-02-21 03:30:33,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:30:33,668 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:30:33,668 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:30:33,670 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:30:33,671 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:30:33,671 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:30:32" (1/3) ... [2022-02-21 03:30:33,671 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3367dd9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:30:33, skipping insertion in model container [2022-02-21 03:30:33,672 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:30:33,672 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:33" (2/3) ... [2022-02-21 03:30:33,672 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3367dd9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:30:33, skipping insertion in model container [2022-02-21 03:30:33,672 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:30:33,672 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:30:33" (3/3) ... [2022-02-21 03:30:33,673 INFO L388 chiAutomizerObserver]: Analyzing ICFG BrockschmidtCookFuhs-2013CAV-Fig1-alloca.i [2022-02-21 03:30:33,699 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:30:33,699 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:30:33,699 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:30:33,699 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:30:33,700 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:30:33,700 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:30:33,700 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:30:33,700 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:30:33,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 03:30:33,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:33,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:33,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:33,723 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:30:33,723 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:30:33,723 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:30:33,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 03:30:33,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:33,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:33,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:33,726 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:30:33,726 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:30:33,730 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem10#1, main_#t~mem5#1, main_#t~mem6#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; 9#L550-3true [2022-02-21 03:30:33,730 INFO L793 eck$LassoCheckResult]: Loop: 9#L550-3true call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 11#L550-1true assume !!(main_#t~mem5#1 < main_#t~mem6#1);havoc main_#t~mem5#1;havoc main_#t~mem6#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 5#L552-3true assume !true; 6#L552-4true call main_#t~mem10#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1; 9#L550-3true [2022-02-21 03:30:33,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:33,733 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:30:33,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:33,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620069268] [2022-02-21 03:30:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:33,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:33,875 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:33,911 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:33,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:33,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2022-02-21 03:30:33,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:33,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918965353] [2022-02-21 03:30:33,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:33,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:33,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {17#true} call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); {17#true} is VALID [2022-02-21 03:30:33,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {17#true} assume !!(main_#t~mem5#1 < main_#t~mem6#1);havoc main_#t~mem5#1;havoc main_#t~mem6#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); {17#true} is VALID [2022-02-21 03:30:33,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {17#true} assume !true; {18#false} is VALID [2022-02-21 03:30:33,997 INFO L290 TraceCheckUtils]: 3: Hoare triple {18#false} call main_#t~mem10#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1; {18#false} is VALID [2022-02-21 03:30:33,999 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 03:30:34,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:30:34,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918965353] [2022-02-21 03:30:34,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918965353] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:30:34,001 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:30:34,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:30:34,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900873431] [2022-02-21 03:30:34,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:30:34,005 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:30:34,006 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:30:34,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:30:34,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:30:34,028 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 03:30:34,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:30:34,049 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-21 03:30:34,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:30:34,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 03:30:34,057 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 03:30:34,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2022-02-21 03:30:34,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:34,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2022-02-21 03:30:34,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:30:34,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:30:34,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2022-02-21 03:30:34,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:30:34,070 INFO L681 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:30:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2022-02-21 03:30:34,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-02-21 03:30:34,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:34,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:34,086 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:34,087 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:34,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:30:34,088 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2022-02-21 03:30:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2022-02-21 03:30:34,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:34,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:34,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 7 states and 8 transitions. [2022-02-21 03:30:34,090 INFO L87 Difference]: Start difference. First operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 7 states and 8 transitions. [2022-02-21 03:30:34,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:30:34,091 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2022-02-21 03:30:34,092 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2022-02-21 03:30:34,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:34,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:34,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:34,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2022-02-21 03:30:34,095 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:30:34,095 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:30:34,095 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:30:34,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2022-02-21 03:30:34,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:34,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:34,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:34,100 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:30:34,100 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:30:34,100 INFO L791 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 31#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem10#1, main_#t~mem5#1, main_#t~mem6#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; 35#L550-3 [2022-02-21 03:30:34,101 INFO L793 eck$LassoCheckResult]: Loop: 35#L550-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 36#L550-1 assume !!(main_#t~mem5#1 < main_#t~mem6#1);havoc main_#t~mem5#1;havoc main_#t~mem6#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 32#L552-3 call main_#t~mem7#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 33#L552-1 assume !(main_#t~mem7#1 <= main_#t~mem8#1);havoc main_#t~mem7#1;havoc main_#t~mem8#1; 34#L552-4 call main_#t~mem10#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1; 35#L550-3 [2022-02-21 03:30:34,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:34,101 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:30:34,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:34,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953814127] [2022-02-21 03:30:34,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:34,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:34,130 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:34,138 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:34,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:34,139 INFO L85 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2022-02-21 03:30:34,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:34,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648341642] [2022-02-21 03:30:34,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:34,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:34,161 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:34,174 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:34,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:34,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2022-02-21 03:30:34,175 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:34,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767049713] [2022-02-21 03:30:34,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:34,202 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:34,228 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:34,723 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:34,723 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:34,723 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:34,731 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:34,731 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:34,732 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:34,732 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:34,732 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:34,732 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca.i_Iteration2_Lasso [2022-02-21 03:30:34,732 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:34,732 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:34,748 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 03:30:35,181 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 03:30:35,184 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 03:30:35,186 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 03:30:35,189 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 03:30:35,191 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 03:30:35,193 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 03:30:35,196 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 03:30:35,198 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 03:30:35,201 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 03:30:35,203 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 03:30:35,205 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 03:30:35,207 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 03:30:35,607 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:35,610 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:35,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:35,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:35,613 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 03:30:35,615 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 03:30:35,618 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 03:30:35,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:35,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:35,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:35,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:35,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:35,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:35,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:35,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:35,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:35,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:35,670 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 03:30:35,671 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 03:30:35,677 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 03:30:35,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:35,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:35,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:35,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:35,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:35,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:35,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:35,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:30:35,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:35,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:35,712 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 03:30:35,727 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 03:30:35,728 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 03:30:35,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:35,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:35,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:35,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:35,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:35,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:35,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:35,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:35,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:35,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:35,776 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 03:30:35,777 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 03:30:35,779 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 03:30:35,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:35,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:35,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:35,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:35,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:35,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:35,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:35,820 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 03:30:35,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:35,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:35,821 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 03:30:35,822 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 03:30:35,824 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 03:30:35,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:35,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:35,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:35,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:35,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:35,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:35,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:35,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:35,850 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 03:30:35,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:35,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:35,852 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 03:30:35,853 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 03:30:35,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:35,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:35,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:35,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:35,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:35,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:35,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:35,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:35,864 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:35,891 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:30:35,892 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:30:35,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:35,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:35,894 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 03:30:35,895 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 03:30:35,896 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:35,896 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:30:35,896 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:35,896 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 Supporting invariants [] [2022-02-21 03:30:35,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:36,074 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2022-02-21 03:30:36,080 INFO L390 LassoCheck]: Loop: "call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4);" "assume !!(main_#t~mem5#1 < main_#t~mem6#1);havoc main_#t~mem5#1;havoc main_#t~mem6#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4);" "call main_#t~mem7#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume !(main_#t~mem7#1 <= main_#t~mem8#1);havoc main_#t~mem7#1;havoc main_#t~mem8#1;" "call main_#t~mem10#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;" [2022-02-21 03:30:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:36,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:36,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:36,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:36,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {60#unseeded} is VALID [2022-02-21 03:30:36,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem10#1, main_#t~mem5#1, main_#t~mem6#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {60#unseeded} is VALID [2022-02-21 03:30:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:36,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:30:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:36,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:36,270 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:30:36,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2022-02-21 03:30:36,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); {63#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} is VALID [2022-02-21 03:30:36,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} assume !!(main_#t~mem5#1 < main_#t~mem6#1);havoc main_#t~mem5#1;havoc main_#t~mem6#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); {204#(and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0))} is VALID [2022-02-21 03:30:36,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#(and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0))} call main_#t~mem7#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {208#(and (exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0) (<= |ULTIMATE.start_main_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1|))} is VALID [2022-02-21 03:30:36,518 INFO L290 TraceCheckUtils]: 3: Hoare triple {208#(and (exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0) (<= |ULTIMATE.start_main_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1|))} assume !(main_#t~mem7#1 <= main_#t~mem8#1);havoc main_#t~mem7#1;havoc main_#t~mem8#1; {212#(exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0)))} is VALID [2022-02-21 03:30:36,519 INFO L290 TraceCheckUtils]: 4: Hoare triple {212#(exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0)))} call main_#t~mem10#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1; {193#(or (and (>= oldRank0 0) (> oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))) unseeded)} is VALID [2022-02-21 03:30:36,519 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 03:30:36,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:36,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 4 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:36,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:36,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,526 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:30:36,526 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:36,558 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 12 states and 13 transitions. Complement of second has 7 states. [2022-02-21 03:30:36,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:36,558 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:36,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:36,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:36,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:36,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:36,559 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:36,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:36,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2022-02-21 03:30:36,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:36,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:36,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:36,561 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:36,562 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:30:36,562 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:36,563 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:36,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 4 transitions. cyclomatic complexity: 1 [2022-02-21 03:30:36,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:36,564 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:30:36,564 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 13 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:36,565 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:30:36,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:36,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:36,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:36,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:36,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:36,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:36,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:30:36,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 12 letters. [2022-02-21 03:30:36,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:30:36,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:30:36,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 7 letters. [2022-02-21 03:30:36,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:30:36,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:36,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:36,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:36,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:30:36,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:36,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:30:36,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:36,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:36,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:36,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:36,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:36,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:36,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:36,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:36,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:36,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:36,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:36,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:36,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:36,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:36,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:36,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:36,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:36,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:36,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:30:36,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:36,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:30:36,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:30:36,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:36,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:30:36,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:30:36,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:36,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:30:36,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,581 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:36,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2022-02-21 03:30:36,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4 transitions. Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:36,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,583 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:30:36,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:36,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:36,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:36,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {60#unseeded} is VALID [2022-02-21 03:30:36,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem10#1, main_#t~mem5#1, main_#t~mem6#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {60#unseeded} is VALID [2022-02-21 03:30:36,660 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 03:30:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:36,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:30:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:36,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:36,736 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:30:36,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2022-02-21 03:30:36,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); {63#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} is VALID [2022-02-21 03:30:36,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} assume !!(main_#t~mem5#1 < main_#t~mem6#1);havoc main_#t~mem5#1;havoc main_#t~mem6#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); {248#(and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0))} is VALID [2022-02-21 03:30:36,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {248#(and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0))} call main_#t~mem7#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {252#(and (exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0) (<= |ULTIMATE.start_main_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1|))} is VALID [2022-02-21 03:30:36,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {252#(and (exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0) (<= |ULTIMATE.start_main_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1|))} assume !(main_#t~mem7#1 <= main_#t~mem8#1);havoc main_#t~mem7#1;havoc main_#t~mem8#1; {256#(exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0)))} is VALID [2022-02-21 03:30:36,968 INFO L290 TraceCheckUtils]: 4: Hoare triple {256#(exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0)))} call main_#t~mem10#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1; {193#(or (and (>= oldRank0 0) (> oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))) unseeded)} is VALID [2022-02-21 03:30:36,968 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 03:30:36,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:36,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 4 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:36,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:36,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:36,975 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:30:36,975 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:36,992 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 12 states and 13 transitions. Complement of second has 7 states. [2022-02-21 03:30:36,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:36,992 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:36,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:36,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:36,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:36,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:36,995 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:36,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:36,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2022-02-21 03:30:36,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:36,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:36,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:36,997 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:36,997 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:30:36,997 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:37,001 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:37,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 4 transitions. cyclomatic complexity: 1 [2022-02-21 03:30:37,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:37,002 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:30:37,002 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 13 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:37,003 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:30:37,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:37,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:37,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:37,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:30:37,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 12 letters. [2022-02-21 03:30:37,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:30:37,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:30:37,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 7 letters. [2022-02-21 03:30:37,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:30:37,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:37,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:37,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:37,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:30:37,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:37,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:30:37,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:37,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:37,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:37,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:37,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:37,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:37,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:37,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:37,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:37,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:37,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:30:37,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:37,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:30:37,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:30:37,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:30:37,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:30:37,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:30:37,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,019 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2022-02-21 03:30:37,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4 transitions. Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:37,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,021 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:30:37,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:37,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:37,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:37,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {60#unseeded} is VALID [2022-02-21 03:30:37,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem10#1, main_#t~mem5#1, main_#t~mem6#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {60#unseeded} is VALID [2022-02-21 03:30:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:37,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:30:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:37,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:37,128 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:30:37,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2022-02-21 03:30:37,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); {63#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} is VALID [2022-02-21 03:30:37,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} assume !!(main_#t~mem5#1 < main_#t~mem6#1);havoc main_#t~mem5#1;havoc main_#t~mem6#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); {292#(and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0))} is VALID [2022-02-21 03:30:37,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#(and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0))} call main_#t~mem7#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {296#(and (exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0) (<= |ULTIMATE.start_main_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1|))} is VALID [2022-02-21 03:30:37,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {296#(and (exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0) (<= |ULTIMATE.start_main_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1|))} assume !(main_#t~mem7#1 <= main_#t~mem8#1);havoc main_#t~mem7#1;havoc main_#t~mem8#1; {300#(exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0)))} is VALID [2022-02-21 03:30:37,352 INFO L290 TraceCheckUtils]: 4: Hoare triple {300#(exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0)))} call main_#t~mem10#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1; {193#(or (and (>= oldRank0 0) (> oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))) unseeded)} is VALID [2022-02-21 03:30:37,352 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 03:30:37,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:37,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 4 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:37,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,357 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:30:37,357 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:37,380 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 12 states and 13 transitions. Complement of second has 6 states. [2022-02-21 03:30:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:37,381 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:37,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:37,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:37,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:37,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:37,383 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:37,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:37,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2022-02-21 03:30:37,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:37,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:37,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:37,385 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:37,385 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:30:37,386 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:37,387 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:37,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 11 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:37,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:37,387 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:30:37,387 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 13 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:37,388 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:30:37,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:37,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:37,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:37,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:30:37,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 12 letters. [2022-02-21 03:30:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:30:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:30:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 7 letters. [2022-02-21 03:30:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:30:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:37,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:37,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:37,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:30:37,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:37,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:30:37,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:37,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:37,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:37,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:37,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:37,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:37,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:37,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:37,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:37,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:37,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:30:37,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:37,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:30:37,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:30:37,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:30:37,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:30:37,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:30:37,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,418 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-02-21 03:30:37,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:37,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,419 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:30:37,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:37,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:37,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:37,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {60#unseeded} is VALID [2022-02-21 03:30:37,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem10#1, main_#t~mem5#1, main_#t~mem6#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {60#unseeded} is VALID [2022-02-21 03:30:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:37,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:30:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:37,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:37,523 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:30:37,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2022-02-21 03:30:37,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); {63#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} is VALID [2022-02-21 03:30:37,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} assume !!(main_#t~mem5#1 < main_#t~mem6#1);havoc main_#t~mem5#1;havoc main_#t~mem6#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); {335#(and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0))} is VALID [2022-02-21 03:30:37,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {335#(and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0))} call main_#t~mem7#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {339#(and (exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0) (<= |ULTIMATE.start_main_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1|))} is VALID [2022-02-21 03:30:37,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {339#(and (exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0) (<= |ULTIMATE.start_main_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1|))} assume !(main_#t~mem7#1 <= main_#t~mem8#1);havoc main_#t~mem7#1;havoc main_#t~mem8#1; {343#(exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0)))} is VALID [2022-02-21 03:30:37,722 INFO L290 TraceCheckUtils]: 4: Hoare triple {343#(exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0)))} call main_#t~mem10#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1; {193#(or (and (>= oldRank0 0) (> oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))) unseeded)} is VALID [2022-02-21 03:30:37,722 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 03:30:37,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:37,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 4 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:37,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,727 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:30:37,727 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:37,745 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 12 states and 13 transitions. Complement of second has 6 states. [2022-02-21 03:30:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:37,745 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:37,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:37,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:37,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:37,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:37,746 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:37,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:37,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2022-02-21 03:30:37,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:37,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:37,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:37,746 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:37,746 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:30:37,746 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:37,747 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:37,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 11 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:37,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:37,747 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:30:37,747 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 13 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:37,747 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:30:37,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:37,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:37,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:37,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:30:37,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 12 letters. [2022-02-21 03:30:37,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:30:37,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:30:37,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 7 letters. [2022-02-21 03:30:37,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:30:37,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:37,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:37,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:37,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:30:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:30:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:37,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:37,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:37,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:37,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:37,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:37,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:37,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:30:37,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:37,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:30:37,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:30:37,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:30:37,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:30:37,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:37,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:30:37,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,751 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-02-21 03:30:37,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:37,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:37,752 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:30:37,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:37,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:37,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:37,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {60#unseeded} is VALID [2022-02-21 03:30:37,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem10#1, main_#t~mem5#1, main_#t~mem6#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {60#unseeded} is VALID [2022-02-21 03:30:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:37,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:30:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:37,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:37,857 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:30:37,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2022-02-21 03:30:38,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); {63#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} is VALID [2022-02-21 03:30:38,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))} assume !!(main_#t~mem5#1 < main_#t~mem6#1);havoc main_#t~mem5#1;havoc main_#t~mem6#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); {378#(and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0))} is VALID [2022-02-21 03:30:38,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#(and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0))} call main_#t~mem7#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); {382#(and (exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0) (<= |ULTIMATE.start_main_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1|))} is VALID [2022-02-21 03:30:38,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {382#(and (exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (or (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~j~0#1.base| |ULTIMATE.start_main_~i~0#1.base|) (= |ULTIMATE.start_main_~i~0#1.offset| |ULTIMATE.start_main_~j~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0) (<= |ULTIMATE.start_main_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1|))} assume !(main_#t~mem7#1 <= main_#t~mem8#1);havoc main_#t~mem7#1;havoc main_#t~mem8#1; {386#(exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0)))} is VALID [2022-02-21 03:30:38,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {386#(exists ((|ULTIMATE.start_main_~j~0#1.base| Int) (|ULTIMATE.start_main_~j~0#1.offset| Int)) (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) oldRank0)) (< (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~j~0#1.base|) |ULTIMATE.start_main_~j~0#1.offset|) 0)))} call main_#t~mem10#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1; {193#(or (and (>= oldRank0 0) (> oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~i~0#1.base|) |ULTIMATE.start_main_~i~0#1.offset|)))) unseeded)} is VALID [2022-02-21 03:30:38,083 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 03:30:38,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:38,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 4 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:38,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:38,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,088 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:30:38,089 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:38,144 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 32 states and 44 transitions. Complement of second has 16 states 5 powerset states11 rank states. The highest rank that occured is 3 [2022-02-21 03:30:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:38,145 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceFKV [2022-02-21 03:30:38,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:38,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:38,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:38,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:38,148 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:38,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:38,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2022-02-21 03:30:38,152 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2022-02-21 03:30:38,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:38,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:38,152 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:38,152 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:30:38,153 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:38,155 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:38,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 25 transitions. cyclomatic complexity: 23 [2022-02-21 03:30:38,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:38,155 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:30:38,155 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 44 transitions. cyclomatic complexity: 16 [2022-02-21 03:30:38,157 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:30:38,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:38,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:38,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:38,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:38,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:38,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:38,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:30:38,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 32 letters. Loop has 32 letters. [2022-02-21 03:30:38,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:30:38,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:30:38,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 7 letters. [2022-02-21 03:30:38,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:30:38,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:38,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:38,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:38,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:30:38,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:38,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:30:38,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:38,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:38,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:38,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:38,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:38,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:38,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:38,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:38,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:38,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:38,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:38,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:38,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:38,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:38,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:38,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:30:38,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 7 letters. [2022-02-21 03:30:38,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:30:38,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:38,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 5 letters. [2022-02-21 03:30:38,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:38,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:38,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:38,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:30:38,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:30:38,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 2 letters. [2022-02-21 03:30:38,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 44 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:30:38,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,162 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceFKV [2022-02-21 03:30:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 03:30:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-02-21 03:30:38,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:38,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:38,164 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:30:38,165 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: no settings was sufficient at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:30:38,168 INFO L158 Benchmark]: Toolchain (without parser) took 5175.84ms. Allocated memory was 115.3MB in the beginning and 195.0MB in the end (delta: 79.7MB). Free memory was 84.4MB in the beginning and 77.0MB in the end (delta: 7.4MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. [2022-02-21 03:30:38,171 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 115.3MB. Free memory was 71.2MB in the beginning and 71.2MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:30:38,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.85ms. Allocated memory is still 115.3MB. Free memory was 84.4MB in the beginning and 83.1MB in the end (delta: 1.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-02-21 03:30:38,175 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.50ms. Allocated memory is still 115.3MB. Free memory was 83.1MB in the beginning and 81.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:30:38,175 INFO L158 Benchmark]: Boogie Preprocessor took 26.18ms. Allocated memory is still 115.3MB. Free memory was 81.3MB in the beginning and 80.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:30:38,175 INFO L158 Benchmark]: RCFGBuilder took 248.74ms. Allocated memory is still 115.3MB. Free memory was 80.0MB in the beginning and 67.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:30:38,176 INFO L158 Benchmark]: BuchiAutomizer took 4498.28ms. Allocated memory was 115.3MB in the beginning and 195.0MB in the end (delta: 79.7MB). Free memory was 67.7MB in the beginning and 77.0MB in the end (delta: -9.2MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2022-02-21 03:30:38,181 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.31ms. Allocated memory is still 115.3MB. Free memory was 71.2MB in the beginning and 71.2MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.85ms. Allocated memory is still 115.3MB. Free memory was 84.4MB in the beginning and 83.1MB in the end (delta: 1.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.50ms. Allocated memory is still 115.3MB. Free memory was 83.1MB in the beginning and 81.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.18ms. Allocated memory is still 115.3MB. Free memory was 81.3MB in the beginning and 80.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 248.74ms. Allocated memory is still 115.3MB. Free memory was 80.0MB in the beginning and 67.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 4498.28ms. Allocated memory was 115.3MB in the beginning and 195.0MB in the end (delta: 79.7MB). Free memory was 67.7MB in the beginning and 77.0MB in the end (delta: -9.2MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: no settings was sufficient de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: no settings was sufficient: de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:30:38,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no settings was sufficient