./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Narrowing.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/Narrowing.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 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 14:52:28,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 14:52:28,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 14:52:28,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 14:52:28,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 14:52:28,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 14:52:28,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 14:52:28,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 14:52:28,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 14:52:28,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 14:52:28,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 14:52:28,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 14:52:28,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 14:52:28,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 14:52:28,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 14:52:28,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 14:52:28,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 14:52:28,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 14:52:28,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 14:52:28,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 14:52:28,497 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 14:52:28,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 14:52:28,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 14:52:28,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 14:52:28,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 14:52:28,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 14:52:28,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 14:52:28,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 14:52:28,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 14:52:28,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 14:52:28,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 14:52:28,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 14:52:28,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 14:52:28,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 14:52:28,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 14:52:28,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 14:52:28,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 14:52:28,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 14:52:28,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 14:52:28,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 14:52:28,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 14:52:28,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 14:52:28,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 14:52:28,536 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 14:52:28,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 14:52:28,537 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 14:52:28,537 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 14:52:28,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 14:52:28,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 14:52:28,538 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 14:52:28,539 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 14:52:28,539 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 14:52:28,539 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 14:52:28,540 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 14:52:28,540 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 14:52:28,540 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 14:52:28,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 14:52:28,540 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 14:52:28,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 14:52:28,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 14:52:28,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 14:52:28,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 14:52:28,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 14:52:28,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 14:52:28,542 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 14:52:28,542 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 14:52:28,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 14:52:28,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 14:52:28,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 14:52:28,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 14:52:28,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 14:52:28,543 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 14:52:28,544 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 -> 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac [2022-07-14 14:52:28,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 14:52:28,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 14:52:28,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 14:52:28,727 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 14:52:28,728 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 14:52:28,729 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Narrowing.c [2022-07-14 14:52:28,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30fbfcd2e/3c8749be47924c43ab2732634b02824a/FLAG0aecd90f4 [2022-07-14 14:52:29,114 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 14:52:29,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2022-07-14 14:52:29,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30fbfcd2e/3c8749be47924c43ab2732634b02824a/FLAG0aecd90f4 [2022-07-14 14:52:29,125 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30fbfcd2e/3c8749be47924c43ab2732634b02824a [2022-07-14 14:52:29,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 14:52:29,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 14:52:29,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 14:52:29,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 14:52:29,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 14:52:29,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:52:29" (1/1) ... [2022-07-14 14:52:29,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6819cabc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:52:29, skipping insertion in model container [2022-07-14 14:52:29,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:52:29" (1/1) ... [2022-07-14 14:52:29,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 14:52:29,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 14:52:29,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:52:29,253 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 14:52:29,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:52:29,268 INFO L208 MainTranslator]: Completed translation [2022-07-14 14:52:29,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:52:29 WrapperNode [2022-07-14 14:52:29,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 14:52:29,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 14:52:29,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 14:52:29,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 14:52:29,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:52:29" (1/1) ... [2022-07-14 14:52:29,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:52:29" (1/1) ... [2022-07-14 14:52:29,287 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2022-07-14 14:52:29,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 14:52:29,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 14:52:29,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 14:52:29,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 14:52:29,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:52:29" (1/1) ... [2022-07-14 14:52:29,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:52:29" (1/1) ... [2022-07-14 14:52:29,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:52:29" (1/1) ... [2022-07-14 14:52:29,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:52:29" (1/1) ... [2022-07-14 14:52:29,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:52:29" (1/1) ... [2022-07-14 14:52:29,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:52:29" (1/1) ... [2022-07-14 14:52:29,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:52:29" (1/1) ... [2022-07-14 14:52:29,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 14:52:29,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 14:52:29,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 14:52:29,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 14:52:29,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:52:29" (1/1) ... [2022-07-14 14:52:29,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:29,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:29,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:29,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-14 14:52:29,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 14:52:29,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 14:52:29,392 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 14:52:29,393 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 14:52:29,454 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 14:52:29,458 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 14:52:29,458 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 14:52:29,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:52:29 BoogieIcfgContainer [2022-07-14 14:52:29,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 14:52:29,469 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 14:52:29,469 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 14:52:29,471 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 14:52:29,472 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:52:29,472 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 02:52:29" (1/3) ... [2022-07-14 14:52:29,473 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12b0d18a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:52:29, skipping insertion in model container [2022-07-14 14:52:29,473 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:52:29,473 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:52:29" (2/3) ... [2022-07-14 14:52:29,473 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12b0d18a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:52:29, skipping insertion in model container [2022-07-14 14:52:29,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:52:29,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:52:29" (3/3) ... [2022-07-14 14:52:29,479 INFO L354 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2022-07-14 14:52:29,517 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 14:52:29,517 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 14:52:29,517 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 14:52:29,517 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 14:52:29,518 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 14:52:29,518 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 14:52:29,518 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 14:52:29,518 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 14:52:29,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:29,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-14 14:52:29,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:52:29,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:52:29,535 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:52:29,536 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:52:29,540 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 14:52:29,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:29,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-14 14:52:29,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:52:29,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:52:29,543 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:52:29,543 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:52:29,547 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 4#L26-1true [2022-07-14 14:52:29,547 INFO L754 eck$LassoCheckResult]: Loop: 4#L26-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 11#L14true assume !(0 == main_~i~0#1); 12#L14-2true assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 9#L17-1true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 6#L20-1true assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10#L23-1true assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4#L26-1true [2022-07-14 14:52:29,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:29,551 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 14:52:29,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:29,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569658891] [2022-07-14 14:52:29,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:29,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:29,599 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:29,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:29,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:29,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1217822514, now seen corresponding path program 1 times [2022-07-14 14:52:29,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:29,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704321321] [2022-07-14 14:52:29,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:29,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:29,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:52:29,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704321321] [2022-07-14 14:52:29,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704321321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:52:29,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:52:29,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 14:52:29,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172267847] [2022-07-14 14:52:29,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:52:29,681 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:52:29,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:52:29,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:52:29,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:52:29,702 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:29,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:52:29,721 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2022-07-14 14:52:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:52:29,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2022-07-14 14:52:29,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-14 14:52:29,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 14 states and 23 transitions. [2022-07-14 14:52:29,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-14 14:52:29,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-14 14:52:29,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2022-07-14 14:52:29,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:52:29,733 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2022-07-14 14:52:29,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2022-07-14 14:52:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-14 14:52:29,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2022-07-14 14:52:29,748 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2022-07-14 14:52:29,748 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2022-07-14 14:52:29,748 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 14:52:29,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2022-07-14 14:52:29,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-14 14:52:29,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:52:29,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:52:29,750 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:52:29,750 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:52:29,750 INFO L752 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 44#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 50#L26-1 [2022-07-14 14:52:29,750 INFO L754 eck$LassoCheckResult]: Loop: 50#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 56#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 53#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 51#L17-1 assume !(1 == main_~up~0#1); 52#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 48#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 50#L26-1 [2022-07-14 14:52:29,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:29,751 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-14 14:52:29,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:29,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023755039] [2022-07-14 14:52:29,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:29,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:29,756 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:29,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:29,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:29,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1215977394, now seen corresponding path program 1 times [2022-07-14 14:52:29,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:29,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146658469] [2022-07-14 14:52:29,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:29,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:29,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:52:29,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146658469] [2022-07-14 14:52:29,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146658469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:52:29,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:52:29,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 14:52:29,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640190710] [2022-07-14 14:52:29,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:52:29,785 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:52:29,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:52:29,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:52:29,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 14:52:29,786 INFO L87 Difference]: Start difference. First operand 14 states and 23 transitions. cyclomatic complexity: 10 Second operand has 4 states, 3 states have (on average 2.0) 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-07-14 14:52:29,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:52:29,818 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2022-07-14 14:52:29,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:52:29,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 61 transitions. [2022-07-14 14:52:29,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-07-14 14:52:29,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 61 transitions. [2022-07-14 14:52:29,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-07-14 14:52:29,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-07-14 14:52:29,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 61 transitions. [2022-07-14 14:52:29,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:52:29,823 INFO L369 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2022-07-14 14:52:29,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 61 transitions. [2022-07-14 14:52:29,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-14 14:52:29,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 37 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2022-07-14 14:52:29,832 INFO L392 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2022-07-14 14:52:29,832 INFO L374 stractBuchiCegarLoop]: Abstraction has 38 states and 61 transitions. [2022-07-14 14:52:29,832 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 14:52:29,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 61 transitions. [2022-07-14 14:52:29,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-07-14 14:52:29,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:52:29,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:52:29,834 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:52:29,834 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:52:29,834 INFO L752 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 103#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 109#L26-1 [2022-07-14 14:52:29,834 INFO L754 eck$LassoCheckResult]: Loop: 109#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 126#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 123#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 120#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 121#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 118#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 109#L26-1 [2022-07-14 14:52:29,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:29,835 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-14 14:52:29,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:29,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077434555] [2022-07-14 14:52:29,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:29,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:29,838 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:29,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:29,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:29,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1216035056, now seen corresponding path program 1 times [2022-07-14 14:52:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:29,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745713889] [2022-07-14 14:52:29,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:29,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:29,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:52:29,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745713889] [2022-07-14 14:52:29,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745713889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:52:29,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:52:29,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 14:52:29,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045661167] [2022-07-14 14:52:29,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:52:29,855 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:52:29,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:52:29,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:52:29,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:52:29,856 INFO L87 Difference]: Start difference. First operand 38 states and 61 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:52:29,866 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2022-07-14 14:52:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:52:29,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 58 transitions. [2022-07-14 14:52:29,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-07-14 14:52:29,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 58 transitions. [2022-07-14 14:52:29,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-07-14 14:52:29,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-07-14 14:52:29,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 58 transitions. [2022-07-14 14:52:29,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:52:29,869 INFO L369 hiAutomatonCegarLoop]: Abstraction has 38 states and 58 transitions. [2022-07-14 14:52:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 58 transitions. [2022-07-14 14:52:29,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-07-14 14:52:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2022-07-14 14:52:29,873 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2022-07-14 14:52:29,873 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2022-07-14 14:52:29,873 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 14:52:29,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2022-07-14 14:52:29,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-07-14 14:52:29,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:52:29,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:52:29,874 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:52:29,874 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:52:29,874 INFO L752 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 190#L26-1 [2022-07-14 14:52:29,874 INFO L754 eck$LassoCheckResult]: Loop: 190#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 201#L14 assume !(0 == main_~i~0#1); 207#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 205#L17-1 assume !(1 == main_~up~0#1); 204#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 202#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 190#L26-1 [2022-07-14 14:52:29,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:29,875 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-14 14:52:29,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:29,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130117496] [2022-07-14 14:52:29,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:29,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:29,878 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:29,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:29,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:29,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1217884020, now seen corresponding path program 1 times [2022-07-14 14:52:29,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:29,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051831339] [2022-07-14 14:52:29,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:29,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:29,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:29,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:29,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:29,890 INFO L85 PathProgramCache]: Analyzing trace with hash 297933238, now seen corresponding path program 1 times [2022-07-14 14:52:29,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:29,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961643076] [2022-07-14 14:52:29,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:29,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:29,894 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:29,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:29,950 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:52:29,950 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:52:29,950 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:52:29,950 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:52:29,951 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:52:29,951 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:29,951 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:52:29,951 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:52:29,951 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2022-07-14 14:52:29,951 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:52:29,952 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:52:29,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:29,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:29,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:29,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:30,047 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:52:30,048 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:52:30,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:30,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:30,064 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:30,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-14 14:52:30,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:52:30,071 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:52:30,093 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:52:30,093 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:52:30,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-14 14:52:30,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:30,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:30,109 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:30,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-14 14:52:30,147 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:52:30,147 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:52:30,164 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:52:30,165 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:52:30,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:30,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:30,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:30,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:30,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-14 14:52:30,183 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:52:30,183 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:52:30,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-14 14:52:30,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:30,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:30,220 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:30,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-14 14:52:30,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:52:30,223 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:52:30,252 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:52:30,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:30,255 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:52:30,255 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:52:30,255 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:52:30,255 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:52:30,255 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:52:30,255 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:30,255 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:52:30,255 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:52:30,255 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2022-07-14 14:52:30,255 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:52:30,255 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:52:30,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:30,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:30,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:30,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:30,335 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:52:30,337 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:52:30,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:30,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:30,340 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:30,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-14 14:52:30,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:52:30,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:52:30,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:52:30,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:52:30,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:52:30,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:52:30,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:52:30,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:52:30,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-14 14:52:30,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:30,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:30,388 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:30,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-14 14:52:30,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:52:30,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:52:30,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:52:30,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:52:30,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:52:30,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:52:30,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:52:30,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:52:30,416 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:52:30,430 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 14:52:30,430 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 14:52:30,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:30,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:30,432 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:30,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-14 14:52:30,434 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:52:30,434 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:52:30,434 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:52:30,434 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-14 14:52:30,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:30,451 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 14:52:30,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:30,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:52:30,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:30,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 14:52:30,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:30,564 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-07-14 14:52:30,564 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:30,601 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 100 states and 152 transitions. Complement of second has 7 states. [2022-07-14 14:52:30,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-07-14 14:52:30,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:30,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-07-14 14:52:30,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2022-07-14 14:52:30,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:52:30,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2022-07-14 14:52:30,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:52:30,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2022-07-14 14:52:30,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:52:30,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 152 transitions. [2022-07-14 14:52:30,609 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 60 [2022-07-14 14:52:30,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 152 transitions. [2022-07-14 14:52:30,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-07-14 14:52:30,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2022-07-14 14:52:30,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 152 transitions. [2022-07-14 14:52:30,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:52:30,611 INFO L369 hiAutomatonCegarLoop]: Abstraction has 100 states and 152 transitions. [2022-07-14 14:52:30,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 152 transitions. [2022-07-14 14:52:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2022-07-14 14:52:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2022-07-14 14:52:30,616 INFO L392 hiAutomatonCegarLoop]: Abstraction has 89 states and 138 transitions. [2022-07-14 14:52:30,617 INFO L374 stractBuchiCegarLoop]: Abstraction has 89 states and 138 transitions. [2022-07-14 14:52:30,617 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 14:52:30,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 138 transitions. [2022-07-14 14:52:30,618 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2022-07-14 14:52:30,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:52:30,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:52:30,618 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-14 14:52:30,618 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:52:30,618 INFO L752 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 365#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 379#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 387#L14 [2022-07-14 14:52:30,619 INFO L754 eck$LassoCheckResult]: Loop: 387#L14 assume !(0 == main_~i~0#1); 438#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 434#L17-1 assume !(1 == main_~up~0#1); 431#L20-1 assume !(0 == main_~up~0#1); 427#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 426#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 387#L14 [2022-07-14 14:52:30,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:30,619 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2022-07-14 14:52:30,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:30,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288915930] [2022-07-14 14:52:30,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:30,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:30,622 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:30,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:30,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:30,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1366755632, now seen corresponding path program 1 times [2022-07-14 14:52:30,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:30,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168457742] [2022-07-14 14:52:30,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:30,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:30,644 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:30,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:30,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:30,651 INFO L85 PathProgramCache]: Analyzing trace with hash 645997719, now seen corresponding path program 1 times [2022-07-14 14:52:30,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:30,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992257388] [2022-07-14 14:52:30,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:30,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:30,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:30,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:52:30,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992257388] [2022-07-14 14:52:30,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992257388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:52:30,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:52:30,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 14:52:30,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631759344] [2022-07-14 14:52:30,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:52:30,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:52:30,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:52:30,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:52:30,692 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. cyclomatic complexity: 54 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:30,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:52:30,701 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2022-07-14 14:52:30,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:52:30,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2022-07-14 14:52:30,703 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2022-07-14 14:52:30,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 102 transitions. [2022-07-14 14:52:30,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-07-14 14:52:30,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-14 14:52:30,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 102 transitions. [2022-07-14 14:52:30,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:52:30,704 INFO L369 hiAutomatonCegarLoop]: Abstraction has 71 states and 102 transitions. [2022-07-14 14:52:30,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 102 transitions. [2022-07-14 14:52:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2022-07-14 14:52:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 64 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2022-07-14 14:52:30,707 INFO L392 hiAutomatonCegarLoop]: Abstraction has 65 states and 94 transitions. [2022-07-14 14:52:30,707 INFO L374 stractBuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2022-07-14 14:52:30,707 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 14:52:30,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 94 transitions. [2022-07-14 14:52:30,708 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-07-14 14:52:30,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:52:30,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:52:30,709 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 14:52:30,709 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:52:30,709 INFO L752 eck$LassoCheckResult]: Stem: 538#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 539#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 553#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 571#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 585#L14-2 [2022-07-14 14:52:30,709 INFO L754 eck$LassoCheckResult]: Loop: 585#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 596#L17-1 assume !(1 == main_~up~0#1); 594#L20-1 assume !(0 == main_~up~0#1); 591#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 540#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 541#L14 assume !(0 == main_~i~0#1); 585#L14-2 [2022-07-14 14:52:30,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:30,709 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2022-07-14 14:52:30,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:30,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194281150] [2022-07-14 14:52:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:30,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:30,713 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:30,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:30,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:30,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1544255282, now seen corresponding path program 2 times [2022-07-14 14:52:30,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:30,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503765875] [2022-07-14 14:52:30,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:30,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:30,735 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:30,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:30,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:30,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1071052759, now seen corresponding path program 1 times [2022-07-14 14:52:30,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:30,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668646238] [2022-07-14 14:52:30,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:30,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:30,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:52:30,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668646238] [2022-07-14 14:52:30,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668646238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:52:30,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:52:30,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 14:52:30,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864563662] [2022-07-14 14:52:30,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:52:30,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:52:30,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:52:30,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:52:30,786 INFO L87 Difference]: Start difference. First operand 65 states and 94 transitions. cyclomatic complexity: 33 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:30,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:52:30,794 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-07-14 14:52:30,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:52:30,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2022-07-14 14:52:30,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-07-14 14:52:30,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 64 transitions. [2022-07-14 14:52:30,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-07-14 14:52:30,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-07-14 14:52:30,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2022-07-14 14:52:30,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:52:30,798 INFO L369 hiAutomatonCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-07-14 14:52:30,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2022-07-14 14:52:30,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-07-14 14:52:30,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:30,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2022-07-14 14:52:30,807 INFO L392 hiAutomatonCegarLoop]: Abstraction has 42 states and 58 transitions. [2022-07-14 14:52:30,807 INFO L374 stractBuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2022-07-14 14:52:30,807 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 14:52:30,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2022-07-14 14:52:30,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-07-14 14:52:30,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:52:30,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:52:30,809 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-14 14:52:30,809 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:52:30,809 INFO L752 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 661#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 677#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 678#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 679#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 686#L17-1 [2022-07-14 14:52:30,809 INFO L754 eck$LassoCheckResult]: Loop: 686#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 666#L20-1 assume !(0 == main_~up~0#1); 667#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 692#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 690#L14 assume !(0 == main_~i~0#1); 688#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 686#L17-1 [2022-07-14 14:52:30,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:30,810 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2022-07-14 14:52:30,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:30,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131295498] [2022-07-14 14:52:30,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:30,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:30,816 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:30,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:30,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:30,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 1 times [2022-07-14 14:52:30,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:30,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198291382] [2022-07-14 14:52:30,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:30,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:30,837 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:30,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:30,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:30,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1214361119, now seen corresponding path program 1 times [2022-07-14 14:52:30,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:30,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105334634] [2022-07-14 14:52:30,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:30,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:30,846 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:30,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:30,887 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:52:30,887 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:52:30,887 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:52:30,887 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:52:30,887 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:52:30,887 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:30,887 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:52:30,887 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:52:30,887 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2022-07-14 14:52:30,888 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:52:30,888 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:52:30,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:30,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:30,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:30,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:30,971 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:52:30,971 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:52:30,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:30,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:30,972 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:30,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-14 14:52:30,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:52:30,974 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:52:30,993 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:52:30,993 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:52:31,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:31,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:31,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:31,010 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:31,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-14 14:52:31,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:52:31,011 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:52:31,027 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:52:31,027 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:52:31,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:31,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:31,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:31,048 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-07-14 14:52:31,049 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-07-14 14:52:31,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:52:31,050 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:52:31,056 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:52:31,057 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:52:31,071 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-07-14 14:52:31,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:31,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:31,072 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-07-14 14:52:31,073 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-07-14 14:52:31,074 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:52:31,074 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:52:31,106 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-07-14 14:52:31,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:31,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:31,108 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:31,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-14 14:52:31,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:52:31,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:52:31,322 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:52:31,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:31,325 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:52:31,325 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:52:31,325 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:52:31,325 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:52:31,326 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:52:31,326 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:31,326 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:52:31,326 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:52:31,326 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2022-07-14 14:52:31,326 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:52:31,326 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:52:31,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:31,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:31,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:31,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:31,421 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:52:31,421 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:52:31,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:31,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:31,424 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:31,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-14 14:52:31,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:52:31,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:52:31,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:52:31,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:52:31,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:52:31,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:52:31,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:52:31,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:52:31,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:31,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:31,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:31,455 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:31,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-14 14:52:31,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:52:31,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:52:31,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:52:31,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:52:31,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:52:31,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:52:31,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:52:31,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:52:31,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-14 14:52:31,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:31,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:31,497 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:31,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-14 14:52:31,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:52:31,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:52:31,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:52:31,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:52:31,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:52:31,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:52:31,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:52:31,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:52:31,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:52:31,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:31,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:31,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:31,533 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:31,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-14 14:52:31,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:52:31,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:52:31,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:52:31,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:52:31,541 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 14:52:31,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:52:31,542 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 14:52:31,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:52:31,547 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:52:31,552 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-14 14:52:31,552 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 14:52:31,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:31,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:31,600 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:31,603 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:52:31,603 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:52:31,603 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:52:31,603 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~range~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-14 14:52:31,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-14 14:52:31,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:31,619 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 14:52:31,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:31,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:52:31,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:31,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 14:52:31,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:31,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:31,705 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-07-14 14:52:31,705 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:31,751 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 91 states and 124 transitions. Complement of second has 7 states. [2022-07-14 14:52:31,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 14:52:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:31,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-07-14 14:52:31,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. [2022-07-14 14:52:31,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:52:31,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2022-07-14 14:52:31,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:52:31,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 12 letters. [2022-07-14 14:52:31,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:52:31,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 124 transitions. [2022-07-14 14:52:31,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-07-14 14:52:31,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 107 transitions. [2022-07-14 14:52:31,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-07-14 14:52:31,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-14 14:52:31,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 107 transitions. [2022-07-14 14:52:31,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:52:31,754 INFO L369 hiAutomatonCegarLoop]: Abstraction has 78 states and 107 transitions. [2022-07-14 14:52:31,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 107 transitions. [2022-07-14 14:52:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2022-07-14 14:52:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 71 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2022-07-14 14:52:31,757 INFO L392 hiAutomatonCegarLoop]: Abstraction has 72 states and 101 transitions. [2022-07-14 14:52:31,757 INFO L374 stractBuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2022-07-14 14:52:31,757 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 14:52:31,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 101 transitions. [2022-07-14 14:52:31,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-07-14 14:52:31,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:52:31,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:52:31,758 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:52:31,758 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:52:31,758 INFO L752 eck$LassoCheckResult]: Stem: 851#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 852#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 867#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 912#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 917#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 863#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 864#L20-1 assume !(0 == main_~up~0#1); 913#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 910#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 868#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 869#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 879#L17-1 [2022-07-14 14:52:31,758 INFO L754 eck$LassoCheckResult]: Loop: 879#L17-1 assume !(1 == main_~up~0#1); 875#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 876#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 892#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 922#L14 assume !(0 == main_~i~0#1); 881#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 879#L17-1 [2022-07-14 14:52:31,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:31,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1214420765, now seen corresponding path program 1 times [2022-07-14 14:52:31,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:31,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689295470] [2022-07-14 14:52:31,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:31,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:31,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:52:31,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689295470] [2022-07-14 14:52:31,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689295470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:52:31,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:52:31,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 14:52:31,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625765271] [2022-07-14 14:52:31,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:52:31,776 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:52:31,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1719875308, now seen corresponding path program 1 times [2022-07-14 14:52:31,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:31,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971011456] [2022-07-14 14:52:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:31,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:31,788 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:31,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:31,820 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:52:31,820 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:52:31,820 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:52:31,820 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:52:31,820 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:52:31,821 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:31,821 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:52:31,821 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:52:31,821 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2022-07-14 14:52:31,821 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:52:31,821 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:52:31,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:31,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:31,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:31,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:31,867 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:52:31,867 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:52:31,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:31,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:31,870 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:31,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-14 14:52:31,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:52:31,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:52:31,884 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:52:31,884 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:52:31,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:31,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:31,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:31,900 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:31,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-14 14:52:31,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:52:31,902 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:52:31,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:31,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:31,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:31,931 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:31,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-14 14:52:31,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:52:31,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:52:32,054 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:52:32,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:32,058 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:52:32,058 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:52:32,058 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:52:32,058 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:52:32,058 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:52:32,058 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:32,058 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:52:32,058 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:52:32,058 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2022-07-14 14:52:32,058 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:52:32,058 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:52:32,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-07-14 14:52:32,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:32,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:32,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:32,110 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:52:32,110 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:52:32,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:32,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:32,111 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:32,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-14 14:52:32,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:52:32,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:52:32,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:52:32,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:52:32,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:52:32,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:52:32,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:52:32,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:52:32,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:32,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:32,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:32,151 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:32,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-14 14:52:32,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:52:32,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:52:32,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:52:32,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:52:32,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:52:32,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:52:32,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:52:32,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:52:32,168 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:52:32,170 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 14:52:32,170 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 14:52:32,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:32,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:32,171 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:32,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-14 14:52:32,220 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:52:32,220 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:52:32,220 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:52:32,220 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-14 14:52:32,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-14 14:52:32,235 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 14:52:32,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:32,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:52:32,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:32,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 14:52:32,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:32,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:32,308 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-07-14 14:52:32,308 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:32,343 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 161 states and 226 transitions. Complement of second has 7 states. [2022-07-14 14:52:32,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 14:52:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-07-14 14:52:32,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 6 letters. [2022-07-14 14:52:32,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:52:32,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 17 letters. Loop has 6 letters. [2022-07-14 14:52:32,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:52:32,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 12 letters. [2022-07-14 14:52:32,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:52:32,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 226 transitions. [2022-07-14 14:52:32,349 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-07-14 14:52:32,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 127 states and 177 transitions. [2022-07-14 14:52:32,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2022-07-14 14:52:32,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2022-07-14 14:52:32,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 177 transitions. [2022-07-14 14:52:32,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:52:32,350 INFO L369 hiAutomatonCegarLoop]: Abstraction has 127 states and 177 transitions. [2022-07-14 14:52:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 177 transitions. [2022-07-14 14:52:32,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2022-07-14 14:52:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.423728813559322) internal successors, (168), 117 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2022-07-14 14:52:32,361 INFO L392 hiAutomatonCegarLoop]: Abstraction has 118 states and 168 transitions. [2022-07-14 14:52:32,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:52:32,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:52:32,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 14:52:32,361 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:32,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:52:32,383 INFO L93 Difference]: Finished difference Result 142 states and 184 transitions. [2022-07-14 14:52:32,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:52:32,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 184 transitions. [2022-07-14 14:52:32,385 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2022-07-14 14:52:32,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 142 states and 184 transitions. [2022-07-14 14:52:32,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2022-07-14 14:52:32,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2022-07-14 14:52:32,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 184 transitions. [2022-07-14 14:52:32,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:52:32,387 INFO L369 hiAutomatonCegarLoop]: Abstraction has 142 states and 184 transitions. [2022-07-14 14:52:32,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 184 transitions. [2022-07-14 14:52:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 118. [2022-07-14 14:52:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.3220338983050848) internal successors, (156), 117 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2022-07-14 14:52:32,390 INFO L392 hiAutomatonCegarLoop]: Abstraction has 118 states and 156 transitions. [2022-07-14 14:52:32,390 INFO L374 stractBuchiCegarLoop]: Abstraction has 118 states and 156 transitions. [2022-07-14 14:52:32,390 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-14 14:52:32,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 156 transitions. [2022-07-14 14:52:32,390 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-07-14 14:52:32,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:52:32,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:52:32,391 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:52:32,391 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:52:32,391 INFO L752 eck$LassoCheckResult]: Stem: 1420#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1421#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 1435#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1475#L14 assume !(0 == main_~i~0#1); 1506#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1505#L17-1 assume !(1 == main_~up~0#1); 1504#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1501#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 1502#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1510#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1509#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1495#L17-1 [2022-07-14 14:52:32,391 INFO L754 eck$LassoCheckResult]: Loop: 1495#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1493#L20-1 assume !(0 == main_~up~0#1); 1491#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1488#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1466#L14 assume !(0 == main_~i~0#1); 1467#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1495#L17-1 [2022-07-14 14:52:32,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:32,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356129, now seen corresponding path program 1 times [2022-07-14 14:52:32,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:32,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609106358] [2022-07-14 14:52:32,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:32,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:32,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:52:32,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609106358] [2022-07-14 14:52:32,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609106358] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:52:32,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005701991] [2022-07-14 14:52:32,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:32,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:52:32,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:32,411 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:52:32,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-14 14:52:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:32,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 14:52:32,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:32,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:52:32,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:32,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:32,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005701991] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:52:32,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:52:32,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-14 14:52:32,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824023906] [2022-07-14 14:52:32,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:52:32,474 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:52:32,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:32,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 2 times [2022-07-14 14:52:32,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:32,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339741445] [2022-07-14 14:52:32,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:32,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:32,488 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:32,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:32,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:32,523 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:52:32,524 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:52:32,524 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:52:32,524 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:52:32,524 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:52:32,524 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:32,524 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:52:32,524 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:52:32,524 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration9_Loop [2022-07-14 14:52:32,524 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:52:32,524 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:52:32,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:32,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:32,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:32,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:32,603 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:52:32,603 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:52:32,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:32,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:32,604 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:32,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-14 14:52:32,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:52:32,606 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:52:32,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:32,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:32,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:32,633 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:32,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-14 14:52:32,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:52:32,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:52:32,838 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:52:32,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-14 14:52:32,842 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:52:32,842 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:52:32,842 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:52:32,842 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:52:32,842 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:52:32,842 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:32,842 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:52:32,842 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:52:32,842 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration9_Loop [2022-07-14 14:52:32,842 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:52:32,842 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:52:32,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:32,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:32,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:32,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:52:32,933 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:52:32,933 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:52:32,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:32,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:32,934 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:32,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-14 14:52:32,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:52:32,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:52:32,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:52:32,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:52:32,941 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 14:52:32,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:52:32,943 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 14:52:32,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:52:32,945 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:52:32,947 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 14:52:32,947 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 14:52:32,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:52:32,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:32,948 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:52:32,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-14 14:52:32,950 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:52:32,950 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:52:32,950 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:52:32,950 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~range~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2022-07-14 14:52:32,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-14 14:52:32,965 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 14:52:32,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:32,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:52:32,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:32,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 14:52:32,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:33,015 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-07-14 14:52:33,015 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 156 transitions. cyclomatic complexity: 48 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:33,036 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 156 transitions. cyclomatic complexity: 48. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 155 states and 198 transitions. Complement of second has 7 states. [2022-07-14 14:52:33,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 14:52:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-07-14 14:52:33,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 6 letters. [2022-07-14 14:52:33,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:52:33,037 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:52:33,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:33,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:52:33,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:33,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 14:52:33,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:33,081 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-14 14:52:33,081 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 156 transitions. cyclomatic complexity: 48 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:33,109 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 156 transitions. cyclomatic complexity: 48. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 204 states and 259 transitions. Complement of second has 9 states. [2022-07-14 14:52:33,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-14 14:52:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-07-14 14:52:33,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 6 letters. [2022-07-14 14:52:33,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:52:33,111 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:52:33,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:33,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:52:33,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:33,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 14:52:33,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:33,156 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 3 loop predicates [2022-07-14 14:52:33,156 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 156 transitions. cyclomatic complexity: 48 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:33,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:33,197 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 156 transitions. cyclomatic complexity: 48. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 186 states and 243 transitions. Complement of second has 8 states. [2022-07-14 14:52:33,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 14:52:33,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:33,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-07-14 14:52:33,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. [2022-07-14 14:52:33,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:52:33,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 17 letters. Loop has 6 letters. [2022-07-14 14:52:33,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:52:33,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 11 letters. Loop has 12 letters. [2022-07-14 14:52:33,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:52:33,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 243 transitions. [2022-07-14 14:52:33,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-07-14 14:52:33,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 140 states and 182 transitions. [2022-07-14 14:52:33,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2022-07-14 14:52:33,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-14 14:52:33,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 182 transitions. [2022-07-14 14:52:33,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:52:33,202 INFO L369 hiAutomatonCegarLoop]: Abstraction has 140 states and 182 transitions. [2022-07-14 14:52:33,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 182 transitions. [2022-07-14 14:52:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 93. [2022-07-14 14:52:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 92 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2022-07-14 14:52:33,205 INFO L392 hiAutomatonCegarLoop]: Abstraction has 93 states and 125 transitions. [2022-07-14 14:52:33,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:52:33,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 14:52:33,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 14:52:33,205 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:52:33,264 INFO L93 Difference]: Finished difference Result 382 states and 489 transitions. [2022-07-14 14:52:33,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 14:52:33,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 382 states and 489 transitions. [2022-07-14 14:52:33,269 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2022-07-14 14:52:33,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 382 states to 366 states and 471 transitions. [2022-07-14 14:52:33,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-14 14:52:33,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-14 14:52:33,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 471 transitions. [2022-07-14 14:52:33,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:52:33,271 INFO L369 hiAutomatonCegarLoop]: Abstraction has 366 states and 471 transitions. [2022-07-14 14:52:33,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 471 transitions. [2022-07-14 14:52:33,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 302. [2022-07-14 14:52:33,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 302 states have (on average 1.2980132450331126) internal successors, (392), 301 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 392 transitions. [2022-07-14 14:52:33,286 INFO L392 hiAutomatonCegarLoop]: Abstraction has 302 states and 392 transitions. [2022-07-14 14:52:33,286 INFO L374 stractBuchiCegarLoop]: Abstraction has 302 states and 392 transitions. [2022-07-14 14:52:33,286 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-14 14:52:33,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 302 states and 392 transitions. [2022-07-14 14:52:33,288 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2022-07-14 14:52:33,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:52:33,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:52:33,289 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-14 14:52:33,289 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-14 14:52:33,289 INFO L752 eck$LassoCheckResult]: Stem: 2830#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2831#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 2846#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3015#L14 assume !(0 == main_~i~0#1); 3013#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 3014#L17-1 assume !(1 == main_~up~0#1); 3131#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2842#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2843#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3130#L14 assume !(0 == main_~i~0#1); 3128#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3118#L17-1 assume !(1 == main_~up~0#1); 3068#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2893#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2895#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2883#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2876#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2877#L17-1 [2022-07-14 14:52:33,289 INFO L754 eck$LassoCheckResult]: Loop: 2877#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3058#L20-1 assume !(0 == main_~up~0#1); 3056#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2885#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2879#L14 assume !(0 == main_~i~0#1); 2854#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2855#L17-1 assume !(1 == main_~up~0#1); 2836#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2837#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3047#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3046#L14 assume !(0 == main_~i~0#1); 2856#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2852#L17-1 assume !(1 == main_~up~0#1); 2853#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2896#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2890#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2884#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2878#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2877#L17-1 [2022-07-14 14:52:33,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:33,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1579420680, now seen corresponding path program 1 times [2022-07-14 14:52:33,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:33,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718738673] [2022-07-14 14:52:33,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:33,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:33,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:52:33,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718738673] [2022-07-14 14:52:33,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718738673] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:52:33,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283804642] [2022-07-14 14:52:33,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:33,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:52:33,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:33,332 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:52:33,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-14 14:52:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:33,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 14:52:33,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:33,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:52:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:33,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283804642] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:52:33,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:52:33,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-14 14:52:33,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111477274] [2022-07-14 14:52:33,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:52:33,404 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:52:33,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:33,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1874596340, now seen corresponding path program 1 times [2022-07-14 14:52:33,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:33,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285746515] [2022-07-14 14:52:33,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:33,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:33,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:52:33,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285746515] [2022-07-14 14:52:33,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285746515] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:52:33,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533197610] [2022-07-14 14:52:33,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:33,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:52:33,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:33,472 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:52:33,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-14 14:52:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:33,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 14:52:33,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:33,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:52:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:33,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533197610] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:52:33,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:52:33,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2022-07-14 14:52:33,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051667887] [2022-07-14 14:52:33,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:52:33,556 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:52:33,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:52:33,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 14:52:33,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 14:52:33,557 INFO L87 Difference]: Start difference. First operand 302 states and 392 transitions. cyclomatic complexity: 108 Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:33,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:52:33,709 INFO L93 Difference]: Finished difference Result 940 states and 1180 transitions. [2022-07-14 14:52:33,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 14:52:33,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 940 states and 1180 transitions. [2022-07-14 14:52:33,713 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 270 [2022-07-14 14:52:33,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 940 states to 906 states and 1143 transitions. [2022-07-14 14:52:33,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 337 [2022-07-14 14:52:33,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 337 [2022-07-14 14:52:33,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 906 states and 1143 transitions. [2022-07-14 14:52:33,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:52:33,717 INFO L369 hiAutomatonCegarLoop]: Abstraction has 906 states and 1143 transitions. [2022-07-14 14:52:33,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states and 1143 transitions. [2022-07-14 14:52:33,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 463. [2022-07-14 14:52:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 463 states have (on average 1.285097192224622) internal successors, (595), 462 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 595 transitions. [2022-07-14 14:52:33,724 INFO L392 hiAutomatonCegarLoop]: Abstraction has 463 states and 595 transitions. [2022-07-14 14:52:33,724 INFO L374 stractBuchiCegarLoop]: Abstraction has 463 states and 595 transitions. [2022-07-14 14:52:33,724 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-14 14:52:33,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 463 states and 595 transitions. [2022-07-14 14:52:33,725 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 129 [2022-07-14 14:52:33,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:52:33,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:52:33,726 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 3, 3, 3, 2, 1, 1, 1] [2022-07-14 14:52:33,726 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:52:33,726 INFO L752 eck$LassoCheckResult]: Stem: 4316#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4317#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 4332#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4531#L14 assume !(0 == main_~i~0#1); 4529#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4528#L17-1 assume !(1 == main_~up~0#1); 4366#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4362#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4363#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4634#L14 assume !(0 == main_~i~0#1); 4631#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 4629#L17-1 assume !(1 == main_~up~0#1); 4627#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4625#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4623#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4622#L14 assume !(0 == main_~i~0#1); 4620#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 4373#L17-1 assume !(1 == main_~up~0#1); 4618#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4616#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4613#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4609#L14 assume !(0 == main_~i~0#1); 4607#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4602#L17-1 assume !(1 == main_~up~0#1); 4601#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4598#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4525#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4594#L14 assume !(0 == main_~i~0#1); 4591#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 4471#L17-1 assume !(1 == main_~up~0#1); 4468#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4466#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4452#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4464#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4462#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4414#L17-1 [2022-07-14 14:52:33,726 INFO L754 eck$LassoCheckResult]: Loop: 4414#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4460#L20-1 assume !(0 == main_~up~0#1); 4459#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4430#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4423#L14 assume !(0 == main_~i~0#1); 4415#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 4382#L17-1 assume !(1 == main_~up~0#1); 4388#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4387#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4375#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4444#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4413#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4414#L17-1 [2022-07-14 14:52:33,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:33,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1344654385, now seen corresponding path program 1 times [2022-07-14 14:52:33,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:33,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151597678] [2022-07-14 14:52:33,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:33,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 14:52:33,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:52:33,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151597678] [2022-07-14 14:52:33,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151597678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:52:33,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:52:33,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 14:52:33,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209327826] [2022-07-14 14:52:33,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:52:33,744 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:52:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash -654021601, now seen corresponding path program 2 times [2022-07-14 14:52:33,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:33,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629026446] [2022-07-14 14:52:33,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:33,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:33,747 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:33,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:33,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:52:33,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:52:33,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 14:52:33,779 INFO L87 Difference]: Start difference. First operand 463 states and 595 transitions. cyclomatic complexity: 150 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:33,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:52:33,794 INFO L93 Difference]: Finished difference Result 453 states and 536 transitions. [2022-07-14 14:52:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:52:33,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 453 states and 536 transitions. [2022-07-14 14:52:33,796 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 129 [2022-07-14 14:52:33,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 453 states to 439 states and 516 transitions. [2022-07-14 14:52:33,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2022-07-14 14:52:33,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2022-07-14 14:52:33,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 439 states and 516 transitions. [2022-07-14 14:52:33,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:52:33,805 INFO L369 hiAutomatonCegarLoop]: Abstraction has 439 states and 516 transitions. [2022-07-14 14:52:33,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states and 516 transitions. [2022-07-14 14:52:33,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2022-07-14 14:52:33,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 421 states have (on average 1.182897862232779) internal successors, (498), 420 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 498 transitions. [2022-07-14 14:52:33,809 INFO L392 hiAutomatonCegarLoop]: Abstraction has 421 states and 498 transitions. [2022-07-14 14:52:33,809 INFO L374 stractBuchiCegarLoop]: Abstraction has 421 states and 498 transitions. [2022-07-14 14:52:33,809 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-14 14:52:33,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 421 states and 498 transitions. [2022-07-14 14:52:33,811 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 128 [2022-07-14 14:52:33,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:52:33,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:52:33,811 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 3, 3, 1, 1, 1, 1] [2022-07-14 14:52:33,811 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:52:33,812 INFO L752 eck$LassoCheckResult]: Stem: 5239#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5240#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 5254#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5440#L14 assume !(0 == main_~i~0#1); 5441#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 5603#L17-1 assume !(1 == main_~up~0#1); 5602#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5253#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 5243#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5244#L14 assume !(0 == main_~i~0#1); 5256#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5251#L17-1 assume !(1 == main_~up~0#1); 5247#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5248#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5483#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5598#L14 assume !(0 == main_~i~0#1); 5597#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5596#L17-1 assume !(1 == main_~up~0#1); 5595#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5594#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 5593#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5592#L14 assume !(0 == main_~i~0#1); 5591#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5590#L17-1 assume !(1 == main_~up~0#1); 5589#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5588#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 5587#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5585#L14 assume !(0 == main_~i~0#1); 5583#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5581#L17-1 assume !(1 == main_~up~0#1); 5579#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5575#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5479#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5494#L14 assume !(0 == main_~i~0#1); 5491#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5489#L17-1 assume !(1 == main_~up~0#1); 5487#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5478#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 5473#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5474#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 5271#L14-2 [2022-07-14 14:52:33,812 INFO L754 eck$LassoCheckResult]: Loop: 5271#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 5272#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5652#L20-1 assume !(0 == main_~up~0#1); 5600#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 5573#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5558#L14 assume !(0 == main_~i~0#1); 5556#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 5554#L17-1 assume !(1 == main_~up~0#1); 5552#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 5481#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 5476#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 5659#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 5271#L14-2 [2022-07-14 14:52:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:33,812 INFO L85 PathProgramCache]: Analyzing trace with hash 816551444, now seen corresponding path program 2 times [2022-07-14 14:52:33,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:33,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570021165] [2022-07-14 14:52:33,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:33,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-14 14:52:33,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:52:33,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570021165] [2022-07-14 14:52:33,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570021165] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:52:33,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:52:33,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:52:33,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592730066] [2022-07-14 14:52:33,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:52:33,844 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:52:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:33,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 3 times [2022-07-14 14:52:33,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:33,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673213272] [2022-07-14 14:52:33,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:33,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:33,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:33,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:33,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:52:33,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 14:52:33,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-14 14:52:33,886 INFO L87 Difference]: Start difference. First operand 421 states and 498 transitions. cyclomatic complexity: 95 Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:52:33,918 INFO L93 Difference]: Finished difference Result 509 states and 569 transitions. [2022-07-14 14:52:33,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 14:52:33,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 509 states and 569 transitions. [2022-07-14 14:52:33,920 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 133 [2022-07-14 14:52:33,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 509 states to 503 states and 563 transitions. [2022-07-14 14:52:33,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2022-07-14 14:52:33,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2022-07-14 14:52:33,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 503 states and 563 transitions. [2022-07-14 14:52:33,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:52:33,923 INFO L369 hiAutomatonCegarLoop]: Abstraction has 503 states and 563 transitions. [2022-07-14 14:52:33,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states and 563 transitions. [2022-07-14 14:52:33,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2022-07-14 14:52:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 501 states have (on average 1.1197604790419162) internal successors, (561), 500 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 561 transitions. [2022-07-14 14:52:33,928 INFO L392 hiAutomatonCegarLoop]: Abstraction has 501 states and 561 transitions. [2022-07-14 14:52:33,928 INFO L374 stractBuchiCegarLoop]: Abstraction has 501 states and 561 transitions. [2022-07-14 14:52:33,928 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-14 14:52:33,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 501 states and 561 transitions. [2022-07-14 14:52:33,929 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 132 [2022-07-14 14:52:33,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:52:33,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:52:33,930 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1] [2022-07-14 14:52:33,930 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:52:33,930 INFO L752 eck$LassoCheckResult]: Stem: 6178#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6179#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 6192#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6310#L14 assume !(0 == main_~i~0#1); 6307#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 6308#L17-1 assume !(1 == main_~up~0#1); 6529#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6526#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 6524#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6521#L14 assume !(0 == main_~i~0#1); 6519#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6517#L17-1 assume !(1 == main_~up~0#1); 6515#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6512#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6510#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6508#L14 assume !(0 == main_~i~0#1); 6506#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6504#L17-1 assume !(1 == main_~up~0#1); 6502#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6499#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6497#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6493#L14 assume !(0 == main_~i~0#1); 6491#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6489#L17-1 assume !(1 == main_~up~0#1); 6487#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6481#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6477#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6471#L14 assume !(0 == main_~i~0#1); 6467#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6463#L17-1 assume !(1 == main_~up~0#1); 6459#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6454#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6413#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6447#L14 assume !(0 == main_~i~0#1); 6444#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6440#L17-1 assume !(1 == main_~up~0#1); 6436#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6411#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 6412#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6210#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 6209#L14-2 [2022-07-14 14:52:33,930 INFO L754 eck$LassoCheckResult]: Loop: 6209#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 6207#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 6208#L20-1 assume !(0 == main_~up~0#1); 6431#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 6427#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6424#L14 assume !(0 == main_~i~0#1); 6422#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 6420#L17-1 assume !(1 == main_~up~0#1); 6418#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 6416#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 6408#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6409#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 6209#L14-2 [2022-07-14 14:52:33,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:33,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1673713296, now seen corresponding path program 3 times [2022-07-14 14:52:33,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:33,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776722842] [2022-07-14 14:52:33,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:33,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:33,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:52:33,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776722842] [2022-07-14 14:52:33,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776722842] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:52:33,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469642884] [2022-07-14 14:52:33,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 14:52:33,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:52:33,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:33,992 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:52:34,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-14 14:52:34,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:52:34,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 14:52:34,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:34,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-14 14:52:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 14:52:34,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:52:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 14:52:34,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469642884] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:52:34,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:52:34,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2022-07-14 14:52:34,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999125229] [2022-07-14 14:52:34,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:52:34,136 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:52:34,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 4 times [2022-07-14 14:52:34,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:34,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106329074] [2022-07-14 14:52:34,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:34,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:34,140 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:34,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:34,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:52:34,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 14:52:34,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2022-07-14 14:52:34,174 INFO L87 Difference]: Start difference. First operand 501 states and 561 transitions. cyclomatic complexity: 82 Second operand has 18 states, 17 states have (on average 5.529411764705882) internal successors, (94), 18 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:52:34,654 INFO L93 Difference]: Finished difference Result 2479 states and 2633 transitions. [2022-07-14 14:52:34,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-14 14:52:34,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2479 states and 2633 transitions. [2022-07-14 14:52:34,663 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 632 [2022-07-14 14:52:34,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2479 states to 2337 states and 2481 transitions. [2022-07-14 14:52:34,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 815 [2022-07-14 14:52:34,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 815 [2022-07-14 14:52:34,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2337 states and 2481 transitions. [2022-07-14 14:52:34,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:52:34,670 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2337 states and 2481 transitions. [2022-07-14 14:52:34,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states and 2481 transitions. [2022-07-14 14:52:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1841. [2022-07-14 14:52:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1841 states have (on average 1.0700706137968496) internal successors, (1970), 1840 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 1970 transitions. [2022-07-14 14:52:34,687 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1841 states and 1970 transitions. [2022-07-14 14:52:34,687 INFO L374 stractBuchiCegarLoop]: Abstraction has 1841 states and 1970 transitions. [2022-07-14 14:52:34,687 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-14 14:52:34,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1841 states and 1970 transitions. [2022-07-14 14:52:34,692 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 390 [2022-07-14 14:52:34,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:52:34,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:52:34,693 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1] [2022-07-14 14:52:34,693 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:52:34,693 INFO L752 eck$LassoCheckResult]: Stem: 9487#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9488#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 9501#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9640#L14 assume !(0 == main_~i~0#1); 9638#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 9639#L17-1 assume !(1 == main_~up~0#1); 9986#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9985#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 9984#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9983#L14 assume !(0 == main_~i~0#1); 9982#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9981#L17-1 assume !(1 == main_~up~0#1); 9980#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9978#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9977#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9976#L14 assume !(0 == main_~i~0#1); 9975#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9974#L17-1 assume !(1 == main_~up~0#1); 9973#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9971#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9970#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9969#L14 assume !(0 == main_~i~0#1); 9968#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9967#L17-1 assume !(1 == main_~up~0#1); 9966#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9964#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9963#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9962#L14 assume !(0 == main_~i~0#1); 9961#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9960#L17-1 assume !(1 == main_~up~0#1); 9959#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9957#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9956#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9955#L14 assume !(0 == main_~i~0#1); 9954#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9953#L17-1 assume !(1 == main_~up~0#1); 9952#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9950#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9949#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9948#L14 assume !(0 == main_~i~0#1); 9947#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9946#L17-1 assume !(1 == main_~up~0#1); 9945#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9943#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9942#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9941#L14 assume !(0 == main_~i~0#1); 9940#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9939#L17-1 assume !(1 == main_~up~0#1); 9938#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9936#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9935#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9934#L14 assume !(0 == main_~i~0#1); 9933#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9932#L17-1 assume !(1 == main_~up~0#1); 9931#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9929#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9928#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9927#L14 assume !(0 == main_~i~0#1); 9926#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9925#L17-1 assume !(1 == main_~up~0#1); 9924#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9922#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9921#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9920#L14 assume !(0 == main_~i~0#1); 9919#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9918#L17-1 assume !(1 == main_~up~0#1); 9917#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9915#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9914#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9913#L14 assume !(0 == main_~i~0#1); 9912#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9911#L17-1 assume !(1 == main_~up~0#1); 9910#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9909#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9665#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9712#L14 assume !(0 == main_~i~0#1); 9699#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9695#L17-1 assume !(1 == main_~up~0#1); 9670#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9663#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 9664#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9521#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 9518#L14-2 [2022-07-14 14:52:34,693 INFO L754 eck$LassoCheckResult]: Loop: 9518#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 9516#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 9517#L20-1 assume !(0 == main_~up~0#1); 9677#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 9676#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9674#L14 assume !(0 == main_~i~0#1); 9673#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 9672#L17-1 assume !(1 == main_~up~0#1); 9671#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 9668#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 9658#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9659#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 9518#L14-2 [2022-07-14 14:52:34,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:34,694 INFO L85 PathProgramCache]: Analyzing trace with hash -214808025, now seen corresponding path program 4 times [2022-07-14 14:52:34,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:34,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651675671] [2022-07-14 14:52:34,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:34,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:52:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:34,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:52:34,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651675671] [2022-07-14 14:52:34,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651675671] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:52:34,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548844101] [2022-07-14 14:52:34,846 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 14:52:34,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:52:34,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:52:34,847 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:52:34,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-14 14:52:34,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 14:52:34,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:52:34,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-14 14:52:34,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:52:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:34,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:52:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:52:35,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548844101] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:52:35,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:52:35,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 24 [2022-07-14 14:52:35,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759811799] [2022-07-14 14:52:35,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:52:35,115 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:52:35,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:35,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 5 times [2022-07-14 14:52:35,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:35,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533199600] [2022-07-14 14:52:35,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:35,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:35,117 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:35,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:35,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:52:35,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 14:52:35,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=360, Unknown=0, NotChecked=0, Total=600 [2022-07-14 14:52:35,155 INFO L87 Difference]: Start difference. First operand 1841 states and 1970 transitions. cyclomatic complexity: 170 Second operand has 25 states, 24 states have (on average 5.458333333333333) internal successors, (131), 25 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:36,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:52:36,002 INFO L93 Difference]: Finished difference Result 5887 states and 6200 transitions. [2022-07-14 14:52:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-07-14 14:52:36,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5887 states and 6200 transitions. [2022-07-14 14:52:36,023 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1451 [2022-07-14 14:52:36,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5887 states to 5733 states and 6032 transitions. [2022-07-14 14:52:36,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2218 [2022-07-14 14:52:36,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2218 [2022-07-14 14:52:36,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5733 states and 6032 transitions. [2022-07-14 14:52:36,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:52:36,040 INFO L369 hiAutomatonCegarLoop]: Abstraction has 5733 states and 6032 transitions. [2022-07-14 14:52:36,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states and 6032 transitions. [2022-07-14 14:52:36,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 2137. [2022-07-14 14:52:36,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 2137 states have (on average 1.0608329433785681) internal successors, (2267), 2136 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:52:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 2267 transitions. [2022-07-14 14:52:36,068 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2137 states and 2267 transitions. [2022-07-14 14:52:36,068 INFO L374 stractBuchiCegarLoop]: Abstraction has 2137 states and 2267 transitions. [2022-07-14 14:52:36,068 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-14 14:52:36,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2137 states and 2267 transitions. [2022-07-14 14:52:36,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 488 [2022-07-14 14:52:36,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:52:36,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:52:36,074 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [21, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1] [2022-07-14 14:52:36,074 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:52:36,074 INFO L752 eck$LassoCheckResult]: Stem: 17845#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 17846#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 17859#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18107#L14 assume !(0 == main_~i~0#1); 18105#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 18106#L17-1 assume !(1 == main_~up~0#1); 18919#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18918#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 18917#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18916#L14 assume !(0 == main_~i~0#1); 18915#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18914#L17-1 assume !(1 == main_~up~0#1); 18913#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18911#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18910#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18909#L14 assume !(0 == main_~i~0#1); 18908#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18907#L17-1 assume !(1 == main_~up~0#1); 18906#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18904#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18903#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18902#L14 assume !(0 == main_~i~0#1); 18901#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18900#L17-1 assume !(1 == main_~up~0#1); 18899#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18897#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18896#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18895#L14 assume !(0 == main_~i~0#1); 18894#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18893#L17-1 assume !(1 == main_~up~0#1); 18892#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18890#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18889#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18888#L14 assume !(0 == main_~i~0#1); 18887#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18886#L17-1 assume !(1 == main_~up~0#1); 18885#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18883#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18882#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18881#L14 assume !(0 == main_~i~0#1); 18880#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18879#L17-1 assume !(1 == main_~up~0#1); 18878#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18876#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18875#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18874#L14 assume !(0 == main_~i~0#1); 18873#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18872#L17-1 assume !(1 == main_~up~0#1); 18871#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18869#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18868#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18867#L14 assume !(0 == main_~i~0#1); 18866#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18865#L17-1 assume !(1 == main_~up~0#1); 18864#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18863#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18862#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18860#L14 assume !(0 == main_~i~0#1); 18858#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18856#L17-1 assume !(1 == main_~up~0#1); 18854#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18852#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18850#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18848#L14 assume !(0 == main_~i~0#1); 18846#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18844#L17-1 assume !(1 == main_~up~0#1); 18842#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18840#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18838#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18836#L14 assume !(0 == main_~i~0#1); 18834#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18832#L17-1 assume !(1 == main_~up~0#1); 18830#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18828#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18826#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18824#L14 assume !(0 == main_~i~0#1); 18822#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18820#L17-1 assume !(1 == main_~up~0#1); 18818#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18816#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18814#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18812#L14 assume !(0 == main_~i~0#1); 18810#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18808#L17-1 assume !(1 == main_~up~0#1); 18806#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18804#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18802#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18800#L14 assume !(0 == main_~i~0#1); 18798#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18796#L17-1 assume !(1 == main_~up~0#1); 18794#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18790#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18788#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18786#L14 assume !(0 == main_~i~0#1); 18784#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18782#L17-1 assume !(1 == main_~up~0#1); 18780#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18776#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18774#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18772#L14 assume !(0 == main_~i~0#1); 18770#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18768#L17-1 assume !(1 == main_~up~0#1); 18766#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18762#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18760#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18758#L14 assume !(0 == main_~i~0#1); 18756#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18754#L17-1 assume !(1 == main_~up~0#1); 18752#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18750#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18739#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18737#L14 assume !(0 == main_~i~0#1); 18735#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18733#L17-1 assume !(1 == main_~up~0#1); 18730#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18731#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18551#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18642#L14 assume !(0 == main_~i~0#1); 18563#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18561#L17-1 assume !(1 == main_~up~0#1); 18559#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18549#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 18550#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18590#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 17889#L14-2 [2022-07-14 14:52:36,074 INFO L754 eck$LassoCheckResult]: Loop: 17889#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 18586#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 18584#L20-1 assume !(0 == main_~up~0#1); 18581#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 18579#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18576#L14 assume !(0 == main_~i~0#1); 18574#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 18572#L17-1 assume !(1 == main_~up~0#1); 18570#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 18567#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 18547#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 18564#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 17889#L14-2 [2022-07-14 14:52:36,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:36,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1715097854, now seen corresponding path program 5 times [2022-07-14 14:52:36,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:36,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697885302] [2022-07-14 14:52:36,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:36,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:36,089 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:36,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:36,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:36,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 6 times [2022-07-14 14:52:36,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:36,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356574750] [2022-07-14 14:52:36,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:36,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:36,103 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:36,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:36,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:52:36,105 INFO L85 PathProgramCache]: Analyzing trace with hash -989936736, now seen corresponding path program 1 times [2022-07-14 14:52:36,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:52:36,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80584616] [2022-07-14 14:52:36,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:52:36,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:52:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:36,132 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:52:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:52:36,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:52:36,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 02:52:36 BoogieIcfgContainer [2022-07-14 14:52:36,890 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 14:52:36,891 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 14:52:36,891 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 14:52:36,891 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 14:52:36,891 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:52:29" (3/4) ... [2022-07-14 14:52:36,893 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-14 14:52:36,922 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 14:52:36,922 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 14:52:36,923 INFO L158 Benchmark]: Toolchain (without parser) took 7795.66ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 58.3MB in the beginning and 106.8MB in the end (delta: -48.5MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2022-07-14 14:52:36,923 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 92.3MB. Free memory was 64.0MB in the beginning and 64.0MB in the end (delta: 27.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:52:36,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 139.58ms. Allocated memory is still 92.3MB. Free memory was 58.1MB in the beginning and 70.8MB in the end (delta: -12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 14:52:36,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.08ms. Allocated memory is still 92.3MB. Free memory was 70.4MB in the beginning and 69.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:52:36,924 INFO L158 Benchmark]: Boogie Preprocessor took 12.86ms. Allocated memory is still 92.3MB. Free memory was 69.1MB in the beginning and 68.2MB in the end (delta: 866.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 14:52:36,924 INFO L158 Benchmark]: RCFGBuilder took 157.38ms. Allocated memory is still 92.3MB. Free memory was 68.2MB in the beginning and 59.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 14:52:36,924 INFO L158 Benchmark]: BuchiAutomizer took 7421.41ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 59.5MB in the beginning and 111.0MB in the end (delta: -51.5MB). Peak memory consumption was 88.2MB. Max. memory is 16.1GB. [2022-07-14 14:52:36,924 INFO L158 Benchmark]: Witness Printer took 31.66ms. Allocated memory is still 161.5MB. Free memory was 111.0MB in the beginning and 106.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 14:52:36,925 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 92.3MB. Free memory was 64.0MB in the beginning and 64.0MB in the end (delta: 27.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 139.58ms. Allocated memory is still 92.3MB. Free memory was 58.1MB in the beginning and 70.8MB in the end (delta: -12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.08ms. Allocated memory is still 92.3MB. Free memory was 70.4MB in the beginning and 69.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.86ms. Allocated memory is still 92.3MB. Free memory was 69.1MB in the beginning and 68.2MB in the end (delta: 866.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 157.38ms. Allocated memory is still 92.3MB. Free memory was 68.2MB in the beginning and 59.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 7421.41ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 59.5MB in the beginning and 111.0MB in the end (delta: -51.5MB). Peak memory consumption was 88.2MB. Max. memory is 16.1GB. * Witness Printer took 31.66ms. Allocated memory is still 161.5MB. Free memory was 111.0MB in the beginning and 106.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 16 terminating modules (12 trivial, 3 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + range and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + range and consists of 4 locations. 12 modules have a trivial ranking function, the largest among these consists of 25 locations. The remainder module has 2137 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.3s and 15 iterations. TraceHistogramMax:21. Analysis of lassos took 4.6s. Construction of modules took 0.6s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 13. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 4733 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 726 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 720 mSDsluCounter, 501 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 302 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1262 IncrementalHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 199 mSDtfsCounter, 1262 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT2 conc2 concLT0 SILN4 SILU0 SILI1 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital28 mio100 ax143 hnf100 lsp60 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf96 smp65 dnf131 smp96 tf106 neg91 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {i=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3bc366c0=0, up=1, range=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 13]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND FALSE !(i == range) [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND TRUE i == range-2 [L27] range = range-1 [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 Loop: [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-14 14:52:36,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:37,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-07-14 14:52:37,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-14 14:52:37,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-07-14 14:52:37,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-07-14 14:52:37,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)