./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/terminator_02-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/terminator_02-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 314932412eeed441a28cefb8ae3e569787d9db1ef6d3b76281c1ff69eee43f8b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:58:21,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:58:21,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:58:21,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:58:21,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:58:21,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:58:21,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:58:21,093 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:58:21,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:58:21,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:58:21,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:58:21,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:58:21,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:58:21,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:58:21,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:58:21,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:58:21,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:58:21,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:58:21,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:58:21,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:58:21,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:58:21,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:58:21,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:58:21,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:58:21,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:58:21,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:58:21,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:58:21,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:58:21,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:58:21,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:58:21,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:58:21,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:58:21,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:58:21,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:58:21,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:58:21,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:58:21,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:58:21,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:58:21,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:58:21,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:58:21,126 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:58:21,127 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:58:21,148 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:58:21,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:58:21,149 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:58:21,149 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:58:21,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:58:21,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:58:21,150 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:58:21,150 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:58:21,151 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:58:21,151 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:58:21,151 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:58:21,152 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:58:21,152 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:58:21,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:58:21,152 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:58:21,152 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:58:21,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:58:21,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:58:21,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:58:21,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:58:21,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:58:21,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:58:21,154 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:58:21,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:58:21,154 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:58:21,154 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:58:21,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:58:21,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:58:21,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:58:21,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:58:21,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:58:21,156 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:58:21,156 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 314932412eeed441a28cefb8ae3e569787d9db1ef6d3b76281c1ff69eee43f8b [2022-02-21 03:58:21,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:58:21,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:58:21,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:58:21,420 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:58:21,420 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:58:21,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/terminator_02-1.c [2022-02-21 03:58:21,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f1a9c75/bdb6f5027cc345868afb9020b6dd7ed7/FLAGd85009955 [2022-02-21 03:58:21,767 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:58:21,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/terminator_02-1.c [2022-02-21 03:58:21,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f1a9c75/bdb6f5027cc345868afb9020b6dd7ed7/FLAGd85009955 [2022-02-21 03:58:22,205 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f1a9c75/bdb6f5027cc345868afb9020b6dd7ed7 [2022-02-21 03:58:22,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:58:22,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:58:22,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:58:22,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:58:22,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:58:22,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22484297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22, skipping insertion in model container [2022-02-21 03:58:22,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:58:22,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:58:22,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/terminator_02-1.c[327,340] [2022-02-21 03:58:22,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:58:22,338 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:58:22,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/terminator_02-1.c[327,340] [2022-02-21 03:58:22,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:58:22,361 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:58:22,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22 WrapperNode [2022-02-21 03:58:22,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:58:22,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:58:22,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:58:22,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:58:22,368 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:58:22" (1/1) ... [2022-02-21 03:58:22,372 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:58:22" (1/1) ... [2022-02-21 03:58:22,389 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2022-02-21 03:58:22,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:58:22,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:58:22,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:58:22,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:58:22,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,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:58:22" (1/1) ... [2022-02-21 03:58:22,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:58:22,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:58:22,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:58:22,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:58:22,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (1/1) ... [2022-02-21 03:58:22,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:22,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:22,461 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:58:22,479 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:58:22,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:58:22,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:58:22,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:58:22,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:58:22,545 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:58:22,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:58:22,673 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:58:22,677 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:58:22,677 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:58:22,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:58:22 BoogieIcfgContainer [2022-02-21 03:58:22,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:58:22,679 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:58:22,679 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:58:22,681 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:58:22,682 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:58:22,682 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:58:22" (1/3) ... [2022-02-21 03:58:22,683 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e40e939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:58:22, skipping insertion in model container [2022-02-21 03:58:22,683 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:58:22,683 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:58:22" (2/3) ... [2022-02-21 03:58:22,684 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e40e939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:58:22, skipping insertion in model container [2022-02-21 03:58:22,684 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:58:22,684 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:58:22" (3/3) ... [2022-02-21 03:58:22,685 INFO L388 chiAutomizerObserver]: Analyzing ICFG terminator_02-1.c [2022-02-21 03:58:22,717 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:58:22,717 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:58:22,718 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:58:22,718 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:58:22,718 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:58:22,718 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:58:22,718 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:58:22,718 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:58:22,749 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:58:22,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:22,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:22,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:22,766 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:58:22,766 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:58:22,766 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:58:22,766 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:58:22,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:22,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:22,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:22,769 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:58:22,769 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:58:22,774 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;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~tmp~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 6#L23-2true [2022-02-21 03:58:22,774 INFO L793 eck$LassoCheckResult]: Loop: 6#L23-2true assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 9#L23true assume !(0 != main_~tmp~0#1 % 256);main_#t~post9#1 := main_~x~0#1;main_~x~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1;main_#t~post10#1 := main_~z~0#1;main_~z~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; 6#L23-2true [2022-02-21 03:58:22,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:22,780 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:58:22,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:22,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582142019] [2022-02-21 03:58:22,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:22,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:22,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:22,876 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:22,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2022-02-21 03:58:22,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:22,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830382366] [2022-02-21 03:58:22,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:22,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:22,892 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:22,898 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:22,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:22,900 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2022-02-21 03:58:22,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:22,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827318724] [2022-02-21 03:58:22,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:22,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:22,919 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:22,932 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:23,040 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:23,041 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:23,042 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:23,042 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:23,042 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:58:23,042 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,042 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:23,043 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:23,043 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-1.c_Iteration1_Loop [2022-02-21 03:58:23,043 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:23,044 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:23,055 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:58:23,060 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:58:23,062 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:58:23,068 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:58:23,073 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:58:23,215 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:58:23,215 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:58:23,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:23,230 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:58:23,231 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:58:23,232 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:23,233 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:23,243 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:58:23,243 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post9#1=0} Honda state: {ULTIMATE.start_main_#t~post9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:58:23,259 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:58:23,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:23,261 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:58:23,263 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:58:23,264 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:23,265 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:23,271 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:58:23,272 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post10#1=0} Honda state: {ULTIMATE.start_main_#t~post10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:58:23,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:23,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:23,288 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:58:23,289 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:58:23,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:23,294 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:23,320 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:58:23,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:23,322 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:58:23,323 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:58:23,324 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:58:23,324 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:23,351 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:58:23,356 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:58:23,357 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:23,357 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:23,357 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:23,357 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:23,357 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:58:23,357 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,357 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:23,357 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:23,357 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-1.c_Iteration1_Loop [2022-02-21 03:58:23,357 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:23,357 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:23,358 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:58:23,363 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:58:23,373 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:58:23,376 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:58:23,381 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:58:23,506 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:58:23,509 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:58:23,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:23,511 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:58:23,518 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:58:23,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:23,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:23,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:23,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:23,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:23,527 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:58:23,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:23,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:23,529 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:23,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 03:58:23,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:23,548 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:58:23,552 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:58:23,553 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:58:23,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:23,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:23,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:23,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:23,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:23,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:23,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:23,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:23,599 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:58:23,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:23,600 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:58:23,608 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:58:23,608 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:58:23,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:23,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:23,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:23,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:23,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:23,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:23,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:23,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:23,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 03:58:23,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:23,642 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:23,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:58:23,644 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:58:23,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:23,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:23,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:23,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:23,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:23,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:23,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:23,671 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:58:23,675 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:58:23,675 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:58:23,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:23,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:23,693 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:23,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:58:23,719 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:58:23,720 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:58:23,720 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:58:23,720 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0#1) = 1*ULTIMATE.start_main_~z~0#1 Supporting invariants [] [2022-02-21 03:58:23,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:23,745 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:58:23,749 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(0 != main_~tmp~0#1 % 256);main_#t~post9#1 := main_~x~0#1;main_~x~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1;main_#t~post10#1 := main_~z~0#1;main_~z~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1;" [2022-02-21 03:58:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:23,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:23,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:58:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:23,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:23,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21#unseeded} is VALID [2022-02-21 03:58:23,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~tmp~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {21#unseeded} is VALID [2022-02-21 03:58:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:23,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:58:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:23,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:23,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#(>= oldRank0 |ULTIMATE.start_main_~z~0#1|)} assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {42#(and (>= oldRank0 |ULTIMATE.start_main_~z~0#1|) (< 100 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-21 03:58:23,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (>= oldRank0 |ULTIMATE.start_main_~z~0#1|) (< 100 |ULTIMATE.start_main_~z~0#1|))} assume !(0 != main_~tmp~0#1 % 256);main_#t~post9#1 := main_~x~0#1;main_~x~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1;main_#t~post10#1 := main_~z~0#1;main_~z~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {34#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~z~0#1|)) unseeded)} is VALID [2022-02-21 03:58:23,851 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:58:23,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:23,876 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:58:23,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:23,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,882 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:58:23,883 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:23,942 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 54 transitions. Complement of second has 7 states. [2022-02-21 03:58:23,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:58:23,943 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:23,943 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:58:23,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:23,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:23,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:23,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:23,946 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:58:23,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:23,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:23,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. [2022-02-21 03:58:23,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:23,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:23,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:23,960 INFO L70 LassoExtractor]: Start lassoExtractor. 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:58:23,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:23,961 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:23,962 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:23,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:58:23,968 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:23,969 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 44 states and 54 transitions. cyclomatic complexity: 12 [2022-02-21 03:58:23,969 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:23,969 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:23,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:23,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:23,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,970 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:23,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:23,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:23,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,971 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:58:23,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:58:23,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:58:23,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,971 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:58:23,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:58:23,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:58:23,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,972 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:58:23,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:58:23,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:58:23,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,972 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:58:23,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:58:23,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:58:23,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,973 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:58:23,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:58:23,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:58:23,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,973 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:23,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:23,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:23,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,977 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:58:23,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:58:23,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:58:23,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,978 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:23,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:23,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:23,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,978 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:58:23,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:58:23,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:58:23,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,979 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:23,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:23,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:23,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,985 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:23,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:23,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-02-21 03:58:23,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:23,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:58:23,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:58:23,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:23,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 54 transitions. cyclomatic complexity: 12 [2022-02-21 03:58:23,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:23,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 9 states and 12 transitions. [2022-02-21 03:58:23,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:58:23,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:58:23,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2022-02-21 03:58:23,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:58:23,999 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:58:24,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2022-02-21 03:58:24,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-02-21 03:58:24,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:58:24,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 12 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:24,013 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 12 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:24,015 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:24,016 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:58:24,017 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2022-02-21 03:58:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:58:24,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:24,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:24,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 12 transitions. [2022-02-21 03:58:24,018 INFO L87 Difference]: Start difference. First operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 12 transitions. [2022-02-21 03:58:24,018 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:58:24,019 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2022-02-21 03:58:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2022-02-21 03:58:24,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:24,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:24,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:58:24,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:58:24,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:24,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2022-02-21 03:58:24,020 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:58:24,020 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:58:24,020 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:58:24,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:58:24,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:24,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:24,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:24,021 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:58:24,021 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:58:24,021 INFO L791 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 101#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~tmp~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 107#L23-2 assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 103#L23 [2022-02-21 03:58:24,021 INFO L793 eck$LassoCheckResult]: Loop: 103#L23 assume 0 != main_~tmp~0#1 % 256;main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 102#L23-2 assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 103#L23 [2022-02-21 03:58:24,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:24,022 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2022-02-21 03:58:24,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:24,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351914187] [2022-02-21 03:58:24,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:24,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:24,031 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:24,042 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2022-02-21 03:58:24,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:24,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440301467] [2022-02-21 03:58:24,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:24,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:24,048 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:24,052 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:24,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:24,052 INFO L85 PathProgramCache]: Analyzing trace with hash 28699749, now seen corresponding path program 1 times [2022-02-21 03:58:24,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:24,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679980827] [2022-02-21 03:58:24,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:24,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:24,068 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:24,074 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:24,109 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:24,109 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:24,109 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:24,109 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:24,109 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:58:24,109 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,109 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:24,109 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:24,109 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-1.c_Iteration2_Loop [2022-02-21 03:58:24,109 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:24,109 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:24,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:58:24,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:58:24,116 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:58:24,120 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:58:24,225 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:58:24,225 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:58:24,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:24,249 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:24,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:24,258 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:24,258 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:24,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:58:24,284 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:58:24,284 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~tmp~0#1=159, ULTIMATE.start_main_#t~nondet7#1=159} Honda state: {ULTIMATE.start_main_~tmp~0#1=159, ULTIMATE.start_main_#t~nondet7#1=159} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:58:24,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:24,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:24,305 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:24,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:58:24,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:24,307 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:24,328 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:58:24,328 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~z~0#1=101} Honda state: {ULTIMATE.start_main_~z~0#1=101} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:58:24,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:24,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:24,348 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:24,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:58:24,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:24,351 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:24,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:24,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:24,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:24,378 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:24,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:58:24,380 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:58:24,380 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:25,186 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:58:25,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:25,191 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:25,191 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:25,191 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:25,191 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:25,191 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:58:25,191 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,191 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:25,191 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:25,191 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-1.c_Iteration2_Loop [2022-02-21 03:58:25,191 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:25,191 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:25,192 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:58:25,202 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:58:25,204 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:58:25,209 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:58:25,305 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:58:25,305 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:58:25,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:25,306 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:25,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:58:25,309 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:58:25,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:25,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:25,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:25,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:25,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:25,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:25,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:25,331 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:25,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 03:58:25,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:25,348 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:25,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:58:25,351 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:58:25,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:25,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:25,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:25,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:25,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:25,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:25,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:25,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:25,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:25,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:25,385 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:25,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:58:25,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:58:25,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:25,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:25,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:25,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:25,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:25,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:25,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:25,403 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:58:25,405 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:58:25,405 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:58:25,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:25,406 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:25,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:58:25,408 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:58:25,408 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:58:25,409 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:58:25,409 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 197 Supporting invariants [] [2022-02-21 03:58:25,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:25,433 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:58:25,437 INFO L390 LassoCheck]: Loop: "assume 0 != main_~tmp~0#1 % 256;main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" [2022-02-21 03:58:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:58:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:25,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {159#unseeded} is VALID [2022-02-21 03:58:25,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~tmp~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {159#unseeded} is VALID [2022-02-21 03:58:25,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#unseeded} assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {159#unseeded} is VALID [2022-02-21 03:58:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:58:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:25,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:25,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#(>= oldRank0 (+ 197 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume 0 != main_~tmp~0#1 % 256;main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {183#(<= (+ (div (+ oldRank0 (- 197)) (- 2)) 1) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:58:25,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#(<= (+ (div (+ oldRank0 (- 197)) (- 2)) 1) |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {172#(or (and (>= oldRank0 0) (> oldRank0 (+ 197 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))) unseeded)} is VALID [2022-02-21 03:58:25,524 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:58:25,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:58:25,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:58:25,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:58:25,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,528 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:58:25,528 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:58:25,549 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 15 states and 20 transitions. Complement of second has 5 states. [2022-02-21 03:58:25,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:58:25,549 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:25,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2022-02-21 03:58:25,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:25,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:25,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:58:25,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:25,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:25,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:25,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2022-02-21 03:58:25,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:25,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:25,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:25,550 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2022-02-21 03:58:25,551 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:25,551 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:58:25,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:25,551 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:58:25,551 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 9 [2022-02-21 03:58:25,551 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:25,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:58:25,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:58:25,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:58:25,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:25,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:58:25,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:25,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:58:25,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:58:25,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:58:25,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:58:25,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 8 letters. [2022-02-21 03:58:25,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:58:25,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:25,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:58:25,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:25,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:58:25,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:58:25,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:58:25,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:58:25,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:58:25,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:58:25,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:25,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:25,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:58:25,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:25,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:25,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:58:25,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:25,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,556 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:58:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2022-02-21 03:58:25,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:58:25,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:25,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:58:25,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:25,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. cyclomatic complexity: 9 [2022-02-21 03:58:25,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:25,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2022-02-21 03:58:25,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:58:25,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-02-21 03:58:25,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2022-02-21 03:58:25,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:58:25,558 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:58:25,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2022-02-21 03:58:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2022-02-21 03:58:25,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:58:25,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 13 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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:58:25,559 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 13 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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:58:25,559 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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:58:25,559 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:58:25,559 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2022-02-21 03:58:25,560 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:58:25,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:25,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:25,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 states and 13 transitions. [2022-02-21 03:58:25,560 INFO L87 Difference]: Start difference. First operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 states and 13 transitions. [2022-02-21 03:58:25,560 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:58:25,561 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2022-02-21 03:58:25,561 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:58:25,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:25,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:25,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:58:25,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:58:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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:58:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2022-02-21 03:58:25,561 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:58:25,561 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:58:25,561 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:58:25,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2022-02-21 03:58:25,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:25,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:25,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:25,562 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2022-02-21 03:58:25,562 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:58:25,562 INFO L791 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 210#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~tmp~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 211#L23-2 assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 212#L23 assume !(0 != main_~tmp~0#1 % 256);main_#t~post9#1 := main_~x~0#1;main_~x~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1;main_#t~post10#1 := main_~z~0#1;main_~z~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; 216#L23-2 assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 214#L23 [2022-02-21 03:58:25,562 INFO L793 eck$LassoCheckResult]: Loop: 214#L23 assume 0 != main_~tmp~0#1 % 256;main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 215#L23-2 assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 214#L23 [2022-02-21 03:58:25,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:25,562 INFO L85 PathProgramCache]: Analyzing trace with hash 28699811, now seen corresponding path program 2 times [2022-02-21 03:58:25,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:25,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233755080] [2022-02-21 03:58:25,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:25,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:25,571 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:25,577 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:25,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:25,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2022-02-21 03:58:25,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:25,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681678517] [2022-02-21 03:58:25,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:25,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:25,581 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:25,584 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:25,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1810715040, now seen corresponding path program 1 times [2022-02-21 03:58:25,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:25,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912542770] [2022-02-21 03:58:25,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:25,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:25,593 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:25,600 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:25,632 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:25,632 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:25,632 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:25,632 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:25,632 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:58:25,632 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,632 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:25,632 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:25,632 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-1.c_Iteration3_Loop [2022-02-21 03:58:25,632 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:25,632 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:25,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:58:25,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:58:25,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:58:25,648 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:58:25,733 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:58:25,733 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:58:25,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:25,734 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:25,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:58:25,736 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:58:25,736 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:25,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:25,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:25,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:25,771 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:25,776 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:58:25,776 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:58:25,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:58:26,586 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:58:26,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:26,590 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:26,590 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:26,590 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:26,590 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:26,590 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:58:26,590 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:26,590 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:26,590 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:26,590 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-1.c_Iteration3_Loop [2022-02-21 03:58:26,590 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:26,590 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:26,591 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:58:26,595 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:58:26,600 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:58:26,602 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:58:26,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:26,698 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:58:26,698 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:58:26,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:26,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:26,699 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:26,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:58:26,703 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:58:26,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:26,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:26,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:26,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:26,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:26,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:26,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:26,719 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:58:26,720 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:58:26,720 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:58:26,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:26,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:26,722 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:26,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:58:26,724 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:58:26,724 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:58:26,724 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:58:26,724 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 197 Supporting invariants [] [2022-02-21 03:58:26,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 03:58:26,748 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:58:26,751 INFO L390 LassoCheck]: Loop: "assume 0 != main_~tmp~0#1 % 256;main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" [2022-02-21 03:58:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:26,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:26,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:58:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:26,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:26,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {278#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {278#unseeded} is VALID [2022-02-21 03:58:26,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~tmp~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {278#unseeded} is VALID [2022-02-21 03:58:26,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {278#unseeded} assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {278#unseeded} is VALID [2022-02-21 03:58:26,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {278#unseeded} assume !(0 != main_~tmp~0#1 % 256);main_#t~post9#1 := main_~x~0#1;main_~x~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1;main_#t~post10#1 := main_~z~0#1;main_~z~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {278#unseeded} is VALID [2022-02-21 03:58:26,788 INFO L290 TraceCheckUtils]: 4: Hoare triple {278#unseeded} assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {278#unseeded} is VALID [2022-02-21 03:58:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:26,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:58:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:26,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:26,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {281#(>= oldRank0 (+ 197 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume 0 != main_~tmp~0#1 % 256;main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {308#(<= (+ (div (+ oldRank0 (- 197)) (- 2)) 1) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:58:26,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {308#(<= (+ (div (+ oldRank0 (- 197)) (- 2)) 1) |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {291#(or (and (>= oldRank0 0) (> oldRank0 (+ 197 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))) unseeded)} is VALID [2022-02-21 03:58:26,836 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:58:26,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:58:26,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,842 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:58:26,842 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,878 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 11 states and 14 transitions. Complement of second has 5 states. [2022-02-21 03:58:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:58:26,878 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:26,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2022-02-21 03:58:26,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:26,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:26,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:26,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:26,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:26,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:58:26,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:26,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:26,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:26,879 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2022-02-21 03:58:26,879 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:26,880 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:26,880 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:58:26,880 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 6 [2022-02-21 03:58:26,880 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:26,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:58:26,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 11 letters. Loop has 11 letters. [2022-02-21 03:58:26,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:58:26,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:58:26,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 8 letters. [2022-02-21 03:58:26,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:58:26,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:26,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 3 letters. [2022-02-21 03:58:26,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:26,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:26,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:26,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:26,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:26,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,884 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2022-02-21 03:58:26,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,885 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:58:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:26,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:58:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:26,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:26,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {278#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {278#unseeded} is VALID [2022-02-21 03:58:26,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~tmp~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {278#unseeded} is VALID [2022-02-21 03:58:26,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {278#unseeded} assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {278#unseeded} is VALID [2022-02-21 03:58:26,927 INFO L290 TraceCheckUtils]: 3: Hoare triple {278#unseeded} assume !(0 != main_~tmp~0#1 % 256);main_#t~post9#1 := main_~x~0#1;main_~x~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1;main_#t~post10#1 := main_~z~0#1;main_~z~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {278#unseeded} is VALID [2022-02-21 03:58:26,927 INFO L290 TraceCheckUtils]: 4: Hoare triple {278#unseeded} assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {278#unseeded} is VALID [2022-02-21 03:58:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:26,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:58:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:26,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:26,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {281#(>= oldRank0 (+ 197 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume 0 != main_~tmp~0#1 % 256;main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {346#(<= (+ (div (+ oldRank0 (- 197)) (- 2)) 1) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:58:26,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {346#(<= (+ (div (+ oldRank0 (- 197)) (- 2)) 1) |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {291#(or (and (>= oldRank0 0) (> oldRank0 (+ 197 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))) unseeded)} is VALID [2022-02-21 03:58:26,967 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:58:26,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:58:26,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,972 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:58:26,972 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,991 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 11 states and 14 transitions. Complement of second has 5 states. [2022-02-21 03:58:26,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:58:26,991 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:26,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2022-02-21 03:58:26,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:26,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:26,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:26,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:26,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:26,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:58:26,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:26,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:26,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:26,992 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2022-02-21 03:58:26,992 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:26,992 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:26,993 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:58:26,993 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 6 [2022-02-21 03:58:26,993 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:26,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:58:26,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 11 letters. Loop has 11 letters. [2022-02-21 03:58:26,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:58:26,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:58:26,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 8 letters. [2022-02-21 03:58:26,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:58:26,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:26,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 3 letters. [2022-02-21 03:58:26,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:26,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:26,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:26,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:26,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:26,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:26,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,999 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2022-02-21 03:58:26,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:26,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:26,999 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:58:27,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:27,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:58:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:27,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:27,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {278#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {278#unseeded} is VALID [2022-02-21 03:58:27,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~tmp~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {278#unseeded} is VALID [2022-02-21 03:58:27,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {278#unseeded} assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {278#unseeded} is VALID [2022-02-21 03:58:27,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {278#unseeded} assume !(0 != main_~tmp~0#1 % 256);main_#t~post9#1 := main_~x~0#1;main_~x~0#1 := main_#t~post9#1 - 1;havoc main_#t~post9#1;main_#t~post10#1 := main_~z~0#1;main_~z~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {278#unseeded} is VALID [2022-02-21 03:58:27,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {278#unseeded} assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {278#unseeded} is VALID [2022-02-21 03:58:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:27,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:58:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:27,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:27,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {281#(>= oldRank0 (+ 197 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume 0 != main_~tmp~0#1 % 256;main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {384#(<= (+ (div (+ oldRank0 (- 197)) (- 2)) 1) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:58:27,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {384#(<= (+ (div (+ oldRank0 (- 197)) (- 2)) 1) |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~x~0#1 < 100 && 100 < main_~z~0#1);main_~tmp~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {291#(or (and (>= oldRank0 0) (> oldRank0 (+ 197 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))) unseeded)} is VALID [2022-02-21 03:58:27,058 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:58:27,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:27,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:58:27,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:27,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,064 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 2 loop predicates [2022-02-21 03:58:27,064 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:27,091 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 11 states and 14 transitions. Complement of second has 4 states. [2022-02-21 03:58:27,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:58:27,092 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:27,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2022-02-21 03:58:27,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:27,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:27,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:27,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:27,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:27,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:27,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:58:27,093 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:58:27,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:58:27,093 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2022-02-21 03:58:27,093 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:58:27,093 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:27,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:27,093 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:58:27,093 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:58:27,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:58:27,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:58:27,094 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:58:27,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:27,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:27,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:27,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:27,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 1 letters. Loop has 2 letters. [2022-02-21 03:58:27,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:27,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:58:27,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 11 letters. Loop has 11 letters. [2022-02-21 03:58:27,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:58:27,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:58:27,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 8 letters. [2022-02-21 03:58:27,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:58:27,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:27,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 3 letters. [2022-02-21 03:58:27,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:58:27,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:27,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:27,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:27,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:27,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:27,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:58:27,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:27,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 1 letters. Loop has 2 letters. [2022-02-21 03:58:27,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:58:27,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,100 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:58:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-02-21 03:58:27,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:58:27,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:58:27,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:58:27,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:27,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:58:27,102 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:58:27,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2022-02-21 03:58:27,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:58:27,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:58:27,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:58:27,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:58:27,102 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:58:27,102 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:58:27,102 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:58:27,102 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:58:27,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:58:27,102 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:58:27,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:58:27,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:58:27 BoogieIcfgContainer [2022-02-21 03:58:27,107 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:58:27,108 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:58:27,108 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:58:27,108 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:58:27,108 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:58:22" (3/4) ... [2022-02-21 03:58:27,110 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:58:27,110 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:58:27,111 INFO L158 Benchmark]: Toolchain (without parser) took 4902.86ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 54.9MB in the beginning and 44.3MB in the end (delta: 10.6MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2022-02-21 03:58:27,111 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 94.4MB. Free memory was 71.5MB in the beginning and 71.4MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:58:27,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.62ms. Allocated memory is still 94.4MB. Free memory was 54.6MB in the beginning and 72.0MB in the end (delta: -17.4MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2022-02-21 03:58:27,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.62ms. Allocated memory is still 94.4MB. Free memory was 72.0MB in the beginning and 70.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:58:27,112 INFO L158 Benchmark]: Boogie Preprocessor took 30.13ms. Allocated memory is still 94.4MB. Free memory was 70.4MB in the beginning and 69.5MB in the end (delta: 957.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:58:27,112 INFO L158 Benchmark]: RCFGBuilder took 257.25ms. Allocated memory is still 94.4MB. Free memory was 69.5MB in the beginning and 70.2MB in the end (delta: -763.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:58:27,112 INFO L158 Benchmark]: BuchiAutomizer took 4428.22ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 70.2MB in the beginning and 44.3MB in the end (delta: 26.0MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2022-02-21 03:58:27,112 INFO L158 Benchmark]: Witness Printer took 2.14ms. Allocated memory is still 113.2MB. Free memory is still 44.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:58:27,114 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.16ms. Allocated memory is still 94.4MB. Free memory was 71.5MB in the beginning and 71.4MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 153.62ms. Allocated memory is still 94.4MB. Free memory was 54.6MB in the beginning and 72.0MB in the end (delta: -17.4MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.62ms. Allocated memory is still 94.4MB. Free memory was 72.0MB in the beginning and 70.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.13ms. Allocated memory is still 94.4MB. Free memory was 70.4MB in the beginning and 69.5MB in the end (delta: 957.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 257.25ms. Allocated memory is still 94.4MB. Free memory was 69.5MB in the beginning and 70.2MB in the end (delta: -763.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 4428.22ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 70.2MB in the beginning and 44.3MB in the end (delta: 26.0MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Witness Printer took 2.14ms. Allocated memory is still 113.2MB. Free memory is still 44.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function z and consists of 5 locations. One deterministic module has affine ranking function 197 + -2 * x and consists of 3 locations. One nondeterministic module has affine ranking function 197 + -2 * x and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 29 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp46 ukn100 mio100 lsp100 div447 bol100 ite100 ukn100 eq150 hnf95 smp41 dnf100 smp100 tf106 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:58:27,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:58:27,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE