./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/KroeningSharyginaTsitovichWintersteiger-CAV2010-Fig1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/KroeningSharyginaTsitovichWintersteiger-CAV2010-Fig1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0f57a241e2c58801cabb7fcf6419a1ee8415c4d2687e9efe6a7f86e17b88f5ca --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:25:02,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:25:02,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:25:02,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:25:02,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:25:02,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:25:02,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:25:02,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:25:02,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:25:02,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:25:02,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:25:02,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:25:02,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:25:02,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:25:02,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:25:02,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:25:02,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:25:02,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:25:02,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:25:02,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:25:02,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:25:02,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:25:02,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:25:02,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:25:02,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:25:02,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:25:02,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:25:02,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:25:02,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:25:02,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:25:02,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:25:02,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:25:02,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:25:02,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:25:02,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:25:02,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:25:02,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:25:02,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:25:02,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:25:02,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:25:02,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:25:02,687 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:25:02,716 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:25:02,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:25:02,717 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:25:02,717 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:25:02,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:25:02,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:25:02,719 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:25:02,719 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:25:02,719 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:25:02,719 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:25:02,720 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:25:02,720 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:25:02,721 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:25:02,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:25:02,721 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:25:02,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:25:02,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:25:02,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:25:02,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:25:02,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:25:02,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:25:02,722 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:25:02,722 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:25:02,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:25:02,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:25:02,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:25:02,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:25:02,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:25:02,725 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:25:02,725 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f57a241e2c58801cabb7fcf6419a1ee8415c4d2687e9efe6a7f86e17b88f5ca [2022-02-21 03:25:02,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:25:02,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:25:02,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:25:02,944 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:25:02,945 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:25:02,946 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/KroeningSharyginaTsitovichWintersteiger-CAV2010-Fig1.c [2022-02-21 03:25:03,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c09caf83f/519b5709bb914409a32e18fa239f3913/FLAG2f7b5a8d9 [2022-02-21 03:25:03,497 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:25:03,498 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/KroeningSharyginaTsitovichWintersteiger-CAV2010-Fig1.c [2022-02-21 03:25:03,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c09caf83f/519b5709bb914409a32e18fa239f3913/FLAG2f7b5a8d9 [2022-02-21 03:25:03,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c09caf83f/519b5709bb914409a32e18fa239f3913 [2022-02-21 03:25:03,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:25:03,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:25:03,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:25:03,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:25:03,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:25:03,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:25:03" (1/1) ... [2022-02-21 03:25:03,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794642d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:03, skipping insertion in model container [2022-02-21 03:25:03,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:25:03" (1/1) ... [2022-02-21 03:25:03,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:25:04,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:25:04,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:25:04,140 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:25:04,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:25:04,161 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:25:04,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:04 WrapperNode [2022-02-21 03:25:04,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:25:04,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:25:04,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:25:04,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:25:04,171 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:25:04" (1/1) ... [2022-02-21 03:25:04,177 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:25:04" (1/1) ... [2022-02-21 03:25:04,205 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2022-02-21 03:25:04,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:25:04,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:25:04,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:25:04,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:25:04,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:04" (1/1) ... [2022-02-21 03:25:04,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:04" (1/1) ... [2022-02-21 03:25:04,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:04" (1/1) ... [2022-02-21 03:25:04,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:04" (1/1) ... [2022-02-21 03:25:04,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:04" (1/1) ... [2022-02-21 03:25:04,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:04" (1/1) ... [2022-02-21 03:25:04,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:04" (1/1) ... [2022-02-21 03:25:04,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:25:04,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:25:04,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:25:04,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:25:04,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:04" (1/1) ... [2022-02-21 03:25:04,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:04,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:04,269 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:25:04,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:25:04,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:25:04,295 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:25:04,348 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:25:04,350 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:25:04,433 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:25:04,439 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:25:04,440 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:25:04,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:04 BoogieIcfgContainer [2022-02-21 03:25:04,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:25:04,442 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:25:04,443 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:25:04,445 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:25:04,446 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:04,447 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:25:03" (1/3) ... [2022-02-21 03:25:04,448 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@347f56de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:25:04, skipping insertion in model container [2022-02-21 03:25:04,448 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:04,448 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:04" (2/3) ... [2022-02-21 03:25:04,448 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@347f56de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:25:04, skipping insertion in model container [2022-02-21 03:25:04,449 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:04,449 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:04" (3/3) ... [2022-02-21 03:25:04,450 INFO L388 chiAutomizerObserver]: Analyzing ICFG KroeningSharyginaTsitovichWintersteiger-CAV2010-Fig1.c [2022-02-21 03:25:04,491 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:25:04,491 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:25:04,492 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:25:04,492 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:25:04,492 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:25:04,492 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:25:04,492 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:25:04,492 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:25:04,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:04,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:04,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:04,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:04,527 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:25:04,528 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:25:04,528 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:25:04,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:04,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:04,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:04,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:04,531 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:25:04,532 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:25:04,537 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~x~0#1, main_~debug~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~debug~0#1 := 0; 10#L23-1true [2022-02-21 03:25:04,537 INFO L793 eck$LassoCheckResult]: Loop: 10#L23-1true assume !!(main_~x~0#1 < 255); 5#L18true assume !(0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2));main_~x~0#1 := 2 + main_~x~0#1; 8#L18-2true assume 0 != main_~debug~0#1;main_~x~0#1 := 0; 10#L23-1true [2022-02-21 03:25:04,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:04,542 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:25:04,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:04,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143210286] [2022-02-21 03:25:04,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:04,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:04,617 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:04,634 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:04,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:04,640 INFO L85 PathProgramCache]: Analyzing trace with hash 40878, now seen corresponding path program 1 times [2022-02-21 03:25:04,641 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:04,641 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80852161] [2022-02-21 03:25:04,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:04,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:04,692 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:04,718 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:04,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash 28699820, now seen corresponding path program 1 times [2022-02-21 03:25:04,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:04,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44847730] [2022-02-21 03:25:04,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:04,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {17#true} assume { :begin_inline_ULTIMATE.init } true; {17#true} is VALID [2022-02-21 03:25:04,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {17#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~x~0#1, main_~debug~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~debug~0#1 := 0; {19#(= |ULTIMATE.start_main_~debug~0#1| 0)} is VALID [2022-02-21 03:25:04,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#(= |ULTIMATE.start_main_~debug~0#1| 0)} assume !!(main_~x~0#1 < 255); {19#(= |ULTIMATE.start_main_~debug~0#1| 0)} is VALID [2022-02-21 03:25:04,829 INFO L290 TraceCheckUtils]: 3: Hoare triple {19#(= |ULTIMATE.start_main_~debug~0#1| 0)} assume !(0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2));main_~x~0#1 := 2 + main_~x~0#1; {19#(= |ULTIMATE.start_main_~debug~0#1| 0)} is VALID [2022-02-21 03:25:04,830 INFO L290 TraceCheckUtils]: 4: Hoare triple {19#(= |ULTIMATE.start_main_~debug~0#1| 0)} assume 0 != main_~debug~0#1;main_~x~0#1 := 0; {18#false} is VALID [2022-02-21 03:25:04,831 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:25:04,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:04,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44847730] [2022-02-21 03:25:04,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44847730] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:25:04,847 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:25:04,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:25:04,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453494292] [2022-02-21 03:25:04,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:25:04,933 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:04,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:25:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:25:04,962 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) 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:25:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:05,001 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:25:05,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:25:05,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) 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:25:05,012 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:25:05,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2022-02-21 03:25:05,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:05,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 5 states and 6 transitions. [2022-02-21 03:25:05,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:25:05,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-02-21 03:25:05,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2022-02-21 03:25:05,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:25:05,030 INFO L681 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2022-02-21 03:25:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2022-02-21 03:25:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2022-02-21 03:25:05,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:05,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states and 6 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:05,050 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states and 6 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:05,051 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:05,053 INFO L93 Difference]: Finished difference Result 5 states and 6 transitions. [2022-02-21 03:25:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 6 transitions. [2022-02-21 03:25:05,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:05,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:05,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 5 states and 6 transitions. [2022-02-21 03:25:05,056 INFO L87 Difference]: Start difference. First operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 5 states and 6 transitions. [2022-02-21 03:25:05,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:05,058 INFO L93 Difference]: Finished difference Result 5 states and 6 transitions. [2022-02-21 03:25:05,058 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 6 transitions. [2022-02-21 03:25:05,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:05,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:05,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:05,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:05,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2022-02-21 03:25:05,098 INFO L704 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2022-02-21 03:25:05,098 INFO L587 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2022-02-21 03:25:05,098 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:25:05,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2022-02-21 03:25:05,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:05,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:05,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:05,099 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:25:05,100 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:25:05,100 INFO L791 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 32#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~x~0#1, main_~debug~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~debug~0#1 := 0; 33#L23-1 [2022-02-21 03:25:05,100 INFO L793 eck$LassoCheckResult]: Loop: 33#L23-1 assume !!(main_~x~0#1 < 255); 29#L18 assume !(0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2));main_~x~0#1 := 2 + main_~x~0#1; 30#L18-2 assume !(0 != main_~debug~0#1); 33#L23-1 [2022-02-21 03:25:05,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:05,101 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:25:05,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:05,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246461561] [2022-02-21 03:25:05,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:05,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:05,109 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:05,115 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:05,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:05,116 INFO L85 PathProgramCache]: Analyzing trace with hash 40880, now seen corresponding path program 1 times [2022-02-21 03:25:05,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:05,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929025088] [2022-02-21 03:25:05,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:05,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:05,142 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:05,148 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:05,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:05,149 INFO L85 PathProgramCache]: Analyzing trace with hash 28699822, now seen corresponding path program 1 times [2022-02-21 03:25:05,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:05,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14924765] [2022-02-21 03:25:05,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:05,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:05,158 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:05,163 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:05,207 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:05,208 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:05,208 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:05,208 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:05,208 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:05,209 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:05,209 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:05,209 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:05,209 INFO L133 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-CAV2010-Fig1.c_Iteration2_Loop [2022-02-21 03:25:05,209 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:05,209 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:05,222 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:25:05,238 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:25:05,328 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:05,328 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:05,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:05,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:05,335 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:25:05,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:05,341 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:05,350 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:25:05,383 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:25:05,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:05,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:05,385 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:25:05,386 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:25:05,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:05,387 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:05,432 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:05,438 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:25:05,438 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:05,439 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:05,439 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:05,439 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:05,439 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:05,439 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:05,439 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:05,439 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:05,439 INFO L133 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-CAV2010-Fig1.c_Iteration2_Loop [2022-02-21 03:25:05,439 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:05,439 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:05,441 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:25:05,449 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:25:05,538 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:05,542 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:05,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:05,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:05,548 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:25:05,549 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:25:05,551 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:25:05,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:05,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:05,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:05,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:05,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:05,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:05,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:05,577 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:05,581 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:05,581 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:25:05,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:05,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:05,586 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:25:05,587 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:25:05,628 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:05,628 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:05,629 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:05,629 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 255 Supporting invariants [] [2022-02-21 03:25:05,651 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:25:05,661 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:05,670 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 < 255);" "assume !(0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2));main_~x~0#1 := 2 + main_~x~0#1;" "assume !(0 != main_~debug~0#1);" [2022-02-21 03:25:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:05,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:05,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:05,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:05,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {53#unseeded} assume { :begin_inline_ULTIMATE.init } true; {53#unseeded} is VALID [2022-02-21 03:25:05,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {53#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~x~0#1, main_~debug~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~debug~0#1 := 0; {53#unseeded} is VALID [2022-02-21 03:25:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:05,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:05,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:05,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 < 255); {74#(and (< |ULTIMATE.start_main_~x~0#1| 255) (>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:25:05,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {74#(and (< |ULTIMATE.start_main_~x~0#1| 255) (>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume !(0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2));main_~x~0#1 := 2 + main_~x~0#1; {78#(and (<= 257 (+ |ULTIMATE.start_main_~x~0#1| oldRank0)) (< 0 oldRank0))} is VALID [2022-02-21 03:25:05,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {78#(and (<= 257 (+ |ULTIMATE.start_main_~x~0#1| oldRank0)) (< 0 oldRank0))} assume !(0 != main_~debug~0#1); {66#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:25:05,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:25:05,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:25:05,842 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:25:05,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 2 letters. Loop has 3 letters. [2022-02-21 03:25:05,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,846 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:25:05,847 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:25:05,886 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 6 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 12 states and 15 transitions. Complement of second has 7 states. [2022-02-21 03:25:05,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:05,887 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:05,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. cyclomatic complexity: 2 [2022-02-21 03:25:05,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:05,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:05,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:25:05,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:05,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:05,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:05,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-02-21 03:25:05,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:05,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:05,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:05,890 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states and 6 transitions. cyclomatic complexity: 2 [2022-02-21 03:25:05,891 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:05,891 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:25:05,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:05,892 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:05,892 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 03:25:05,892 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:05,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:05,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 2 letters. Loop has 3 letters. [2022-02-21 03:25:05,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:05,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:05,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:25:05,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:05,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:05,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 3 letters. [2022-02-21 03:25:05,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:05,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:05,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 12 letters. Loop has 12 letters. [2022-02-21 03:25:05,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:05,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:05,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 5 letters. [2022-02-21 03:25:05,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:05,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:05,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 4 letters. [2022-02-21 03:25:05,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:05,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:05,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 2 letters. Loop has 3 letters. [2022-02-21 03:25:05,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:05,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:05,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:25:05,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:05,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:05,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 3 letters. [2022-02-21 03:25:05,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:05,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:05,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:25:05,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:05,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:25:05,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 3 letters. [2022-02-21 03:25:05,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:25:05,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:25:05,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 3 letters. [2022-02-21 03:25:05,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:25:05,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:05,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 3 letters. [2022-02-21 03:25:05,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:05,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,906 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:25:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2022-02-21 03:25:05,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:05,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:25:05,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:25:05,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:05,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 03:25:05,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:05,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 15 transitions. [2022-02-21 03:25:05,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:25:05,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:25:05,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2022-02-21 03:25:05,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:05,911 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 03:25:05,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2022-02-21 03:25:05,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-02-21 03:25:05,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:05,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) 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:25:05,913 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) 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:25:05,914 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) 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:25:05,914 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:05,916 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2022-02-21 03:25:05,916 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2022-02-21 03:25:05,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:05,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:05,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 11 states have (on average 1.2727272727272727) 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 12 states and 15 transitions. [2022-02-21 03:25:05,917 INFO L87 Difference]: Start difference. First operand has 11 states, 11 states have (on average 1.2727272727272727) 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 12 states and 15 transitions. [2022-02-21 03:25:05,917 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:05,919 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 03:25:05,919 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-21 03:25:05,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:05,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:05,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:05,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:05,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) 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:25:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2022-02-21 03:25:05,920 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 03:25:05,921 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 03:25:05,921 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:25:05,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:25:05,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:05,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:05,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:05,922 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:25:05,922 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:25:05,922 INFO L791 eck$LassoCheckResult]: Stem: 108#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 109#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~x~0#1, main_~debug~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~debug~0#1 := 0; 113#L23-1 assume !!(main_~x~0#1 < 255); 104#L18 assume 0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2);main_#t~post1#1 := main_~x~0#1;main_~x~0#1 := main_#t~post1#1 - 1;havoc main_#t~post1#1; 105#L18-2 [2022-02-21 03:25:05,922 INFO L793 eck$LassoCheckResult]: Loop: 105#L18-2 assume !(0 != main_~debug~0#1); 110#L23-1 assume !!(main_~x~0#1 < 255); 114#L18 assume !(0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2));main_~x~0#1 := 2 + main_~x~0#1; 105#L18-2 [2022-02-21 03:25:05,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:05,923 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2022-02-21 03:25:05,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:05,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056603740] [2022-02-21 03:25:05,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:05,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:05,930 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:05,936 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:05,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:05,936 INFO L85 PathProgramCache]: Analyzing trace with hash 51290, now seen corresponding path program 2 times [2022-02-21 03:25:05,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:05,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539903258] [2022-02-21 03:25:05,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:05,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:05,943 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:05,949 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:05,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:05,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1810665941, now seen corresponding path program 1 times [2022-02-21 03:25:05,950 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:05,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607645597] [2022-02-21 03:25:05,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:05,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:05,998 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:06,010 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:25:06,012 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:06,050 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:06,050 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:06,050 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:06,051 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:06,051 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:06,051 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,051 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:06,051 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:06,051 INFO L133 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-CAV2010-Fig1.c_Iteration3_Loop [2022-02-21 03:25:06,051 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:06,051 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:06,052 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:25:06,059 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:25:06,135 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:06,135 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:06,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:06,137 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:25:06,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:06,147 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:06,156 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:25:06,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:06,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:06,190 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:25:06,191 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:25:06,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:06,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:06,241 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:06,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:25:06,244 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:06,244 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:06,244 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:06,244 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:06,245 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:06,245 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,245 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:06,245 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:06,245 INFO L133 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-CAV2010-Fig1.c_Iteration3_Loop [2022-02-21 03:25:06,245 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:06,245 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:06,246 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:25:06,254 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:25:06,342 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:06,342 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:06,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:06,343 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:25:06,358 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:25:06,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:06,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:06,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:06,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:06,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:06,367 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:25:06,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:06,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:06,381 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:06,384 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:06,384 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:25:06,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:06,388 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:25:06,389 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:25:06,390 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:06,390 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:06,390 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:06,390 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 255 Supporting invariants [] [2022-02-21 03:25:06,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:06,426 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:06,433 INFO L390 LassoCheck]: Loop: "assume !(0 != main_~debug~0#1);" "assume !!(main_~x~0#1 < 255);" "assume !(0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2));main_~x~0#1 := 2 + main_~x~0#1;" [2022-02-21 03:25:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:06,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:06,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:06,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:06,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#unseeded} assume { :begin_inline_ULTIMATE.init } true; {178#unseeded} is VALID [2022-02-21 03:25:06,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~x~0#1, main_~debug~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~debug~0#1 := 0; {178#unseeded} is VALID [2022-02-21 03:25:06,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {178#unseeded} assume !!(main_~x~0#1 < 255); {178#unseeded} is VALID [2022-02-21 03:25:06,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {178#unseeded} assume 0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2);main_#t~post1#1 := main_~x~0#1;main_~x~0#1 := main_#t~post1#1 - 1;havoc main_#t~post1#1; {178#unseeded} is VALID [2022-02-21 03:25:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:06,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:06,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:06,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {181#(>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} assume !(0 != main_~debug~0#1); {181#(>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:25:06,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#(>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 < 255); {208#(and (< |ULTIMATE.start_main_~x~0#1| 255) (>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:25:06,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#(and (< |ULTIMATE.start_main_~x~0#1| 255) (>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume !(0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2));main_~x~0#1 := 2 + main_~x~0#1; {191#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:25:06,556 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:25:06,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:25:06,566 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:25:06,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:06,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,567 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:25:06,568 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:25:06,603 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 17 states and 22 transitions. Complement of second has 7 states. [2022-02-21 03:25:06,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:06,603 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:06,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:25:06,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:06,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:06,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:25:06,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:06,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:06,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:06,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2022-02-21 03:25:06,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:06,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:06,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:06,612 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:25:06,612 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:06,612 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:25:06,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:06,613 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:06,614 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 22 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:06,614 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:06,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:06,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:06,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:06,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:06,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 3 letters. [2022-02-21 03:25:06,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:06,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:06,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:06,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:06,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:25:06,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 17 letters. Loop has 17 letters. [2022-02-21 03:25:06,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:25:06,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,617 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:25:06,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:25:06,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:25:06,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:06,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:06,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:06,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:25:06,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 3 letters. [2022-02-21 03:25:06,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:25:06,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:06,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:06,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:06,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:25:06,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 3 letters. [2022-02-21 03:25:06,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:25:06,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:06,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 3 letters. [2022-02-21 03:25:06,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:06,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:06,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:06,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:06,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:06,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 3 letters. [2022-02-21 03:25:06,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:06,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:06,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 9 letters. Loop has 3 letters. [2022-02-21 03:25:06,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:06,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,625 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:25:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2022-02-21 03:25:06,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:06,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:06,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:25:06,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:06,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:06,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:06,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2022-02-21 03:25:06,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:25:06,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:25:06,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2022-02-21 03:25:06,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:06,637 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-02-21 03:25:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2022-02-21 03:25:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-21 03:25:06,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:06,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 22 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 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:25:06,638 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 22 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 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:25:06,639 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 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:25:06,639 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:06,643 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-02-21 03:25:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-02-21 03:25:06,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:06,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:06,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 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 17 states and 22 transitions. [2022-02-21 03:25:06,644 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 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 17 states and 22 transitions. [2022-02-21 03:25:06,644 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:06,646 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-02-21 03:25:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-02-21 03:25:06,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:06,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:06,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:06,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 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:25:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-02-21 03:25:06,647 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-02-21 03:25:06,647 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-02-21 03:25:06,648 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:25:06,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2022-02-21 03:25:06,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:06,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:06,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:06,649 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2022-02-21 03:25:06,649 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:25:06,649 INFO L791 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 244#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~x~0#1, main_~debug~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~debug~0#1 := 0; 251#L23-1 assume !!(main_~x~0#1 < 255); 239#L18 assume 0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2);main_#t~post1#1 := main_~x~0#1;main_~x~0#1 := main_#t~post1#1 - 1;havoc main_#t~post1#1; 240#L18-2 assume !(0 != main_~debug~0#1); 252#L23-1 assume !!(main_~x~0#1 < 255); 254#L18 assume 0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2);main_#t~post1#1 := main_~x~0#1;main_~x~0#1 := main_#t~post1#1 - 1;havoc main_#t~post1#1; 245#L18-2 [2022-02-21 03:25:06,649 INFO L793 eck$LassoCheckResult]: Loop: 245#L18-2 assume !(0 != main_~debug~0#1); 246#L23-1 assume !!(main_~x~0#1 < 255); 253#L18 assume !(0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2));main_~x~0#1 := 2 + main_~x~0#1; 245#L18-2 [2022-02-21 03:25:06,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:06,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1810665939, now seen corresponding path program 1 times [2022-02-21 03:25:06,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:06,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441635765] [2022-02-21 03:25:06,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:06,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:06,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {329#true} assume { :begin_inline_ULTIMATE.init } true; {329#true} is VALID [2022-02-21 03:25:06,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {329#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~x~0#1, main_~debug~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~debug~0#1 := 0; {329#true} is VALID [2022-02-21 03:25:06,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {329#true} assume !!(main_~x~0#1 < 255); {329#true} is VALID [2022-02-21 03:25:06,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {329#true} assume 0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2);main_#t~post1#1 := main_~x~0#1;main_~x~0#1 := main_#t~post1#1 - 1;havoc main_#t~post1#1; {331#(<= |ULTIMATE.start_main_~x~0#1| (* (div |ULTIMATE.start_main_~x~0#1| 2) 2))} is VALID [2022-02-21 03:25:06,707 INFO L290 TraceCheckUtils]: 4: Hoare triple {331#(<= |ULTIMATE.start_main_~x~0#1| (* (div |ULTIMATE.start_main_~x~0#1| 2) 2))} assume !(0 != main_~debug~0#1); {331#(<= |ULTIMATE.start_main_~x~0#1| (* (div |ULTIMATE.start_main_~x~0#1| 2) 2))} is VALID [2022-02-21 03:25:06,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#(<= |ULTIMATE.start_main_~x~0#1| (* (div |ULTIMATE.start_main_~x~0#1| 2) 2))} assume !!(main_~x~0#1 < 255); {331#(<= |ULTIMATE.start_main_~x~0#1| (* (div |ULTIMATE.start_main_~x~0#1| 2) 2))} is VALID [2022-02-21 03:25:06,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {331#(<= |ULTIMATE.start_main_~x~0#1| (* (div |ULTIMATE.start_main_~x~0#1| 2) 2))} assume 0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2);main_#t~post1#1 := main_~x~0#1;main_~x~0#1 := main_#t~post1#1 - 1;havoc main_#t~post1#1; {330#false} is VALID [2022-02-21 03:25:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:06,711 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:06,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441635765] [2022-02-21 03:25:06,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441635765] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:25:06,711 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:25:06,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:25:06,711 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056098200] [2022-02-21 03:25:06,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:25:06,712 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:25:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:06,712 INFO L85 PathProgramCache]: Analyzing trace with hash 51290, now seen corresponding path program 3 times [2022-02-21 03:25:06,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:06,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179548513] [2022-02-21 03:25:06,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:06,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:06,721 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:06,726 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:06,751 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:06,751 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:06,751 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:06,751 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:06,751 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:06,751 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,752 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:06,752 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:06,752 INFO L133 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-CAV2010-Fig1.c_Iteration4_Loop [2022-02-21 03:25:06,752 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:06,752 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:06,752 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:25:06,755 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:25:06,841 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:06,841 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:06,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:06,843 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:25:06,844 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:25:06,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:06,845 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:06,868 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:06,868 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~debug~0#1=0} Honda state: {ULTIMATE.start_main_~debug~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:06,890 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:25:06,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:06,893 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:25:06,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:06,902 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:06,913 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:25:06,947 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:25:06,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:06,949 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:25:06,949 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:25:06,951 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:06,951 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:06,977 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:06,980 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:25:06,980 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:06,980 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:06,980 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:06,980 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:06,980 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:06,980 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:06,980 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:06,980 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:06,980 INFO L133 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-CAV2010-Fig1.c_Iteration4_Loop [2022-02-21 03:25:06,980 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:06,981 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:06,981 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:25:07,000 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:25:07,042 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:25:07,091 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:07,092 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:07,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:07,093 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:25:07,100 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:25:07,102 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:25:07,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:07,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:07,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:07,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:07,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:07,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:07,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:07,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:07,151 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:25:07,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:07,152 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:25:07,153 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:25:07,154 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:25:07,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:07,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:07,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:07,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:07,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:07,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:07,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:07,180 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:07,183 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:07,183 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:25:07,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:07,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:07,184 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:25:07,185 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:25:07,186 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:07,186 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:07,186 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:07,186 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 255 Supporting invariants [] [2022-02-21 03:25:07,203 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:25:07,210 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:07,213 INFO L390 LassoCheck]: Loop: "assume !(0 != main_~debug~0#1);" "assume !!(main_~x~0#1 < 255);" "assume !(0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2));main_~x~0#1 := 2 + main_~x~0#1;" [2022-02-21 03:25:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:07,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {334#unseeded} assume { :begin_inline_ULTIMATE.init } true; {334#unseeded} is VALID [2022-02-21 03:25:07,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~x~0#1, main_~debug~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~debug~0#1 := 0; {334#unseeded} is VALID [2022-02-21 03:25:07,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#unseeded} assume !!(main_~x~0#1 < 255); {334#unseeded} is VALID [2022-02-21 03:25:07,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {334#unseeded} assume 0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2);main_#t~post1#1 := main_~x~0#1;main_~x~0#1 := main_#t~post1#1 - 1;havoc main_#t~post1#1; {334#unseeded} is VALID [2022-02-21 03:25:07,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {334#unseeded} assume !(0 != main_~debug~0#1); {334#unseeded} is VALID [2022-02-21 03:25:07,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#unseeded} assume !!(main_~x~0#1 < 255); {334#unseeded} is VALID [2022-02-21 03:25:07,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {334#unseeded} assume 0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2);main_#t~post1#1 := main_~x~0#1;main_~x~0#1 := main_#t~post1#1 - 1;havoc main_#t~post1#1; {334#unseeded} is VALID [2022-02-21 03:25:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:07,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#(>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} assume !(0 != main_~debug~0#1); {337#(>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:25:07,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#(>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 < 255); {373#(and (< |ULTIMATE.start_main_~x~0#1| 255) (>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:25:07,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {373#(and (< |ULTIMATE.start_main_~x~0#1| 255) (>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume !(0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2));main_~x~0#1 := 2 + main_~x~0#1; {347#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:25:07,287 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:25:07,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:07,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,293 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:25:07,293 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,316 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 28 transitions. Complement of second has 7 states. [2022-02-21 03:25:07,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:07,317 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:07,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:07,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:07,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:07,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:07,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:07,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:07,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2022-02-21 03:25:07,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:07,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:07,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:07,319 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 22 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:07,320 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:07,320 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:07,320 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:07,320 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 10 [2022-02-21 03:25:07,321 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:07,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:25:07,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:25:07,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:25:07,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:25:07,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:25:07,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:25:07,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:07,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:07,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:07,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:07,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:07,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:07,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:07,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:07,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:07,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,329 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2022-02-21 03:25:07,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,330 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:07,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:07,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {334#unseeded} assume { :begin_inline_ULTIMATE.init } true; {334#unseeded} is VALID [2022-02-21 03:25:07,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~x~0#1, main_~debug~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~debug~0#1 := 0; {334#unseeded} is VALID [2022-02-21 03:25:07,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#unseeded} assume !!(main_~x~0#1 < 255); {334#unseeded} is VALID [2022-02-21 03:25:07,361 INFO L290 TraceCheckUtils]: 3: Hoare triple {334#unseeded} assume 0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2);main_#t~post1#1 := main_~x~0#1;main_~x~0#1 := main_#t~post1#1 - 1;havoc main_#t~post1#1; {334#unseeded} is VALID [2022-02-21 03:25:07,361 INFO L290 TraceCheckUtils]: 4: Hoare triple {334#unseeded} assume !(0 != main_~debug~0#1); {334#unseeded} is VALID [2022-02-21 03:25:07,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#unseeded} assume !!(main_~x~0#1 < 255); {334#unseeded} is VALID [2022-02-21 03:25:07,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {334#unseeded} assume 0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2);main_#t~post1#1 := main_~x~0#1;main_~x~0#1 := main_#t~post1#1 - 1;havoc main_#t~post1#1; {334#unseeded} is VALID [2022-02-21 03:25:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:07,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#(>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} assume !(0 != main_~debug~0#1); {337#(>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:25:07,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#(>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 < 255); {433#(and (< |ULTIMATE.start_main_~x~0#1| 255) (>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:25:07,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {433#(and (< |ULTIMATE.start_main_~x~0#1| 255) (>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume !(0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2));main_~x~0#1 := 2 + main_~x~0#1; {347#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:25:07,392 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:25:07,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:07,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,398 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:25:07,398 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,416 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 28 transitions. Complement of second has 7 states. [2022-02-21 03:25:07,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:07,417 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:07,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:07,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:07,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:07,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:07,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:07,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:07,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2022-02-21 03:25:07,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:07,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:07,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:07,419 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 22 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:07,419 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:07,419 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:07,420 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:07,420 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 10 [2022-02-21 03:25:07,420 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:07,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:25:07,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:25:07,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:25:07,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:25:07,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:25:07,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:25:07,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:07,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:07,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:07,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:07,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:07,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:07,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:07,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:07,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:07,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,427 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2022-02-21 03:25:07,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,428 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:07,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:07,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {334#unseeded} assume { :begin_inline_ULTIMATE.init } true; {334#unseeded} is VALID [2022-02-21 03:25:07,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~x~0#1, main_~debug~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~debug~0#1 := 0; {334#unseeded} is VALID [2022-02-21 03:25:07,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#unseeded} assume !!(main_~x~0#1 < 255); {334#unseeded} is VALID [2022-02-21 03:25:07,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {334#unseeded} assume 0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2);main_#t~post1#1 := main_~x~0#1;main_~x~0#1 := main_#t~post1#1 - 1;havoc main_#t~post1#1; {334#unseeded} is VALID [2022-02-21 03:25:07,460 INFO L290 TraceCheckUtils]: 4: Hoare triple {334#unseeded} assume !(0 != main_~debug~0#1); {334#unseeded} is VALID [2022-02-21 03:25:07,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#unseeded} assume !!(main_~x~0#1 < 255); {334#unseeded} is VALID [2022-02-21 03:25:07,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {334#unseeded} assume 0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2);main_#t~post1#1 := main_~x~0#1;main_~x~0#1 := main_#t~post1#1 - 1;havoc main_#t~post1#1; {334#unseeded} is VALID [2022-02-21 03:25:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:07,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:07,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#(>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} assume !(0 != main_~debug~0#1); {337#(>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:25:07,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#(>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 < 255); {493#(and (< |ULTIMATE.start_main_~x~0#1| 255) (>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:25:07,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {493#(and (< |ULTIMATE.start_main_~x~0#1| 255) (>= oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume !(0 != (if main_~x~0#1 < 0 && 0 != main_~x~0#1 % 2 then main_~x~0#1 % 2 - 2 else main_~x~0#1 % 2));main_~x~0#1 := 2 + main_~x~0#1; {347#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 255 (* (- 1) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:25:07,493 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:25:07,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:07,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,499 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:25:07,499 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,526 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 32 transitions. Complement of second has 6 states. [2022-02-21 03:25:07,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:07,527 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:07,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:07,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:07,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:07,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:07,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:07,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:07,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2022-02-21 03:25:07,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:07,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:07,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:07,530 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 22 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:07,530 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:07,530 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:07,531 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:07,531 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 32 transitions. cyclomatic complexity: 11 [2022-02-21 03:25:07,531 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:07,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:25:07,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:25:07,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:25:07,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:25:07,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:25:07,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:25:07,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:07,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:07,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:07,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:07,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:07,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:25:07,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:07,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:25:07,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,541 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-02-21 03:25:07,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:25:07,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:25:07,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:25:07,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:07,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 32 transitions. cyclomatic complexity: 11 [2022-02-21 03:25:07,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:07,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 26 transitions. [2022-02-21 03:25:07,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:25:07,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:25:07,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2022-02-21 03:25:07,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:07,546 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-21 03:25:07,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2022-02-21 03:25:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 9. [2022-02-21 03:25:07,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:07,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 26 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,548 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 26 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,548 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,548 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:07,549 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-21 03:25:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-21 03:25:07,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:07,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:07,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 26 transitions. [2022-02-21 03:25:07,550 INFO L87 Difference]: Start difference. First operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 26 transitions. [2022-02-21 03:25:07,550 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:07,551 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-21 03:25:07,552 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-21 03:25:07,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:07,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:07,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:07,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2022-02-21 03:25:07,553 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:25:07,553 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:07,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:25:07,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:25:07,554 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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:25:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:07,566 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-02-21 03:25:07,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:25:07,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) 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:25:07,577 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:25:07,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2022-02-21 03:25:07,579 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:07,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2022-02-21 03:25:07,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:25:07,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:25:07,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:25:07,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:25:07,580 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:07,580 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:07,580 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:07,580 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:25:07,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:25:07,581 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:07,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:07,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:25:07 BoogieIcfgContainer [2022-02-21 03:25:07,587 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:25:07,587 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:25:07,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:25:07,588 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:25:07,588 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:04" (3/4) ... [2022-02-21 03:25:07,590 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:25:07,590 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:25:07,591 INFO L158 Benchmark]: Toolchain (without parser) took 3607.90ms. Allocated memory was 109.1MB in the beginning and 140.5MB in the end (delta: 31.5MB). Free memory was 79.1MB in the beginning and 61.4MB in the end (delta: 17.7MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2022-02-21 03:25:07,592 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 109.1MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:07,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.32ms. Allocated memory was 109.1MB in the beginning and 140.5MB in the end (delta: 31.5MB). Free memory was 79.1MB in the beginning and 116.4MB in the end (delta: -37.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:25:07,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.53ms. Allocated memory is still 140.5MB. Free memory was 116.4MB in the beginning and 115.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:07,593 INFO L158 Benchmark]: Boogie Preprocessor took 19.58ms. Allocated memory is still 140.5MB. Free memory was 115.2MB in the beginning and 114.3MB in the end (delta: 891.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:25:07,594 INFO L158 Benchmark]: RCFGBuilder took 212.15ms. Allocated memory is still 140.5MB. Free memory was 114.3MB in the beginning and 105.5MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:25:07,594 INFO L158 Benchmark]: BuchiAutomizer took 3144.56ms. Allocated memory is still 140.5MB. Free memory was 105.5MB in the beginning and 61.4MB in the end (delta: 44.1MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2022-02-21 03:25:07,594 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 140.5MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:07,596 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.22ms. Allocated memory is still 109.1MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.32ms. Allocated memory was 109.1MB in the beginning and 140.5MB in the end (delta: 31.5MB). Free memory was 79.1MB in the beginning and 116.4MB in the end (delta: -37.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.53ms. Allocated memory is still 140.5MB. Free memory was 116.4MB in the beginning and 115.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.58ms. Allocated memory is still 140.5MB. Free memory was 115.2MB in the beginning and 114.3MB in the end (delta: 891.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 212.15ms. Allocated memory is still 140.5MB. Free memory was 114.3MB in the beginning and 105.5MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3144.56ms. Allocated memory is still 140.5MB. Free memory was 105.5MB in the beginning and 61.4MB in the end (delta: 44.1MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 140.5MB. Free memory is still 61.4MB. 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 255 + -1 * x and consists of 4 locations. One deterministic module has affine ranking function 255 + -1 * x and consists of 4 locations. One nondeterministic module has affine ranking function 255 + -1 * x and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 46 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc1 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp83 ukn100 mio100 lsp100 div346 bol100 ite100 ukn100 eq150 hnf94 smp47 dnf100 smp100 tf105 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 85ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:25:07,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:07,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE