./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/NonTermination3-1.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 fabc9d8a61dd824da0c561a6d62c57fe8eb320f6ad8009599cd12699fa04e01c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:23:51,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:23:51,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:23:51,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:23:51,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:23:51,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:23:51,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:23:51,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:23:51,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:23:51,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:23:51,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:23:51,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:23:51,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:23:51,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:23:51,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:23:51,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:23:51,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:23:51,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:23:51,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:23:51,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:23:51,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:23:51,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:23:51,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:23:51,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:23:51,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:23:51,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:23:51,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:23:51,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:23:51,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:23:51,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:23:51,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:23:51,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:23:51,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:23:51,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:23:51,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:23:51,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:23:51,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:23:51,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:23:51,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:23:51,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:23:51,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:23:51,654 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:23:51,677 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:23:51,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:23:51,677 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:23:51,678 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:23:51,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:23:51,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:23:51,679 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:23:51,679 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:23:51,679 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:23:51,679 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:23:51,680 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:23:51,680 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:23:51,680 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:23:51,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:23:51,680 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:23:51,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:23:51,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:23:51,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:23:51,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:23:51,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:23:51,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:23:51,681 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:23:51,682 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:23:51,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:23:51,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:23:51,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:23:51,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:23:51,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:23:51,684 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:23:51,684 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 -> fabc9d8a61dd824da0c561a6d62c57fe8eb320f6ad8009599cd12699fa04e01c [2022-02-21 03:23:51,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:23:51,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:23:51,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:23:51,881 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:23:51,882 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:23:51,884 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2022-02-21 03:23:51,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/574d0cec7/bbfcae5ab4224677bbcb2b27666bae58/FLAGbe716cd17 [2022-02-21 03:23:52,320 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:23:52,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2022-02-21 03:23:52,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/574d0cec7/bbfcae5ab4224677bbcb2b27666bae58/FLAGbe716cd17 [2022-02-21 03:23:52,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/574d0cec7/bbfcae5ab4224677bbcb2b27666bae58 [2022-02-21 03:23:52,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:23:52,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:23:52,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:52,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:23:52,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:23:52,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:52" (1/1) ... [2022-02-21 03:23:52,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f83240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:52, skipping insertion in model container [2022-02-21 03:23:52,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:52" (1/1) ... [2022-02-21 03:23:52,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:23:52,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:23:52,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:52,908 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:23:52,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:52,932 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:23:52,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:52 WrapperNode [2022-02-21 03:23:52,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:52,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:52,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:23:52,935 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:23:52,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:52" (1/1) ... [2022-02-21 03:23:52,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:52" (1/1) ... [2022-02-21 03:23:52,960 INFO L137 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2022-02-21 03:23:52,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:52,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:23:52,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:23:52,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:23:52,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:52" (1/1) ... [2022-02-21 03:23:52,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:52" (1/1) ... [2022-02-21 03:23:52,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:52" (1/1) ... [2022-02-21 03:23:52,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:52" (1/1) ... [2022-02-21 03:23:52,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:52" (1/1) ... [2022-02-21 03:23:52,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:52" (1/1) ... [2022-02-21 03:23:52,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:52" (1/1) ... [2022-02-21 03:23:52,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:23:52,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:23:53,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:23:53,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:23:53,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:52" (1/1) ... [2022-02-21 03:23:53,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:53,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:53,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:53,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:23:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:23:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:23:53,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:23:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:23:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:23:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:23:53,097 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:23:53,098 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:23:53,235 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:23:53,255 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:23:53,255 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:23:53,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:53 BoogieIcfgContainer [2022-02-21 03:23:53,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:23:53,257 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:23:53,257 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:23:53,259 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:23:53,276 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:53,276 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:23:52" (1/3) ... [2022-02-21 03:23:53,277 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@438275f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:53, skipping insertion in model container [2022-02-21 03:23:53,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:53,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:52" (2/3) ... [2022-02-21 03:23:53,278 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@438275f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:53, skipping insertion in model container [2022-02-21 03:23:53,278 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:53,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:53" (3/3) ... [2022-02-21 03:23:53,279 INFO L388 chiAutomizerObserver]: Analyzing ICFG NonTermination3-1.c [2022-02-21 03:23:53,325 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:23:53,325 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:23:53,325 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:23:53,325 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:23:53,326 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:23:53,326 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:23:53,326 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:23:53,326 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:23:53,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:53,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:23:53,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:53,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:53,366 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:23:53,367 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:23:53,367 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:23:53,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:53,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:23:53,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:53,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:53,372 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:23:53,372 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:23:53,377 INFO L791 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 9#L13-3true [2022-02-21 03:23:53,378 INFO L793 eck$LassoCheckResult]: Loop: 9#L13-3true assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 8#L13-2true main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 9#L13-3true [2022-02-21 03:23:53,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:53,382 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:23:53,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:53,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514310913] [2022-02-21 03:23:53,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:53,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:53,471 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:53,499 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:53,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:53,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-02-21 03:23:53,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:53,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784969132] [2022-02-21 03:23:53,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:53,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:53,526 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:53,541 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:53,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:53,542 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 03:23:53,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:53,543 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039690573] [2022-02-21 03:23:53,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:53,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:53,576 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:53,596 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:53,834 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:53,834 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:53,835 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:53,835 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:53,835 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:53,835 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:53,835 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:53,835 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:53,836 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-1.c_Iteration1_Lasso [2022-02-21 03:23:53,836 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:53,836 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:53,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:53,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:53,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:53,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:53,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:53,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:53,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:53,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:53,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:53,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-02-21 03:23:54,167 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:54,171 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:54,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:54,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:54,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:54,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:23:54,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:54,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:54,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:54,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:54,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:54,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:54,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:54,215 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:54,235 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-02-21 03:23:54,235 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-02-21 03:23:54,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:54,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:54,240 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:54,272 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:54,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:23:54,292 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:23:54,293 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:54,293 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1, ULTIMATE.start_main_~n~0#1) = 19*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 - 8*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2022-02-21 03:23:54,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:54,342 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:23:54,353 INFO L390 LassoCheck]: Loop: "assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1;" "main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1;" [2022-02-21 03:23:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:54,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:54,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:23:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:54,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:54,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2022-02-21 03:23:54,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {21#unseeded} is VALID [2022-02-21 03:23:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:54,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:23:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:54,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:54,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#(>= oldRank0 (+ (* (- 8) |ULTIMATE.start_main_~n~0#1|) (* 19 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|))))} assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; {47#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (< |ULTIMATE.start_main_~n~0#1| 10) (>= oldRank0 (+ (* |ULTIMATE.start_main_~n~0#1| (- 8)) (* 19 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))))} is VALID [2022-02-21 03:23:54,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (< |ULTIMATE.start_main_~n~0#1| 10) (>= oldRank0 (+ (* |ULTIMATE.start_main_~n~0#1| (- 8)) (* 19 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)))))} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {39#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 8) |ULTIMATE.start_main_~n~0#1|) (* 19 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|))))) unseeded)} is VALID [2022-02-21 03:23:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:54,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:54,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:54,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:54,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,528 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:23:54,529 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:54,628 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 37 transitions. Complement of second has 8 states. [2022-02-21 03:23:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:54,628 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:54,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:54,630 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:23:54,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:54,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:54,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:54,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:54,632 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:23:54,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:54,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:54,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 37 transitions. [2022-02-21 03:23:54,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:54,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:54,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:54,635 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:54,636 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:23:54,637 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:23:54,637 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:54,638 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:23:54,638 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:23:54,638 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 37 transitions. cyclomatic complexity: 16 [2022-02-21 03:23:54,639 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:23:54,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:54,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:54,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:54,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:23:54,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:23:54,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:23:54,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:54,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:54,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:54,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:23:54,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:23:54,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:23:54,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:23:54,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:23:54,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:23:54,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:54,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:54,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:54,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:54,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:54,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:54,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:23:54,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:23:54,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:23:54,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:23:54,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:23:54,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:23:54,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:23:54,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:23:54,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:23:54,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:54,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:54,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:54,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:23:54,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:23:54,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:23:54,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:23:54,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:23:54,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:23:54,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:23:54,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:23:54,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:23:54,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:54,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:54,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:54,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:23:54,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:23:54,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 37 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:23:54,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,664 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:54,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-21 03:23:54,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:23:54,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:23:54,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:23:54,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 37 transitions. cyclomatic complexity: 16 [2022-02-21 03:23:54,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:54,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 9 states and 12 transitions. [2022-02-21 03:23:54,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:23:54,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:23:54,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2022-02-21 03:23:54,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:54,679 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:23:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2022-02-21 03:23:54,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-02-21 03:23:54,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:54,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 12 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:54,696 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 12 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:54,698 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:54,700 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2022-02-21 03:23:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:23:54,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:54,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:54,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 12 transitions. [2022-02-21 03:23:54,702 INFO L87 Difference]: Start difference. First operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 12 transitions. [2022-02-21 03:23:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:54,703 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2022-02-21 03:23:54,703 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:23:54,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:54,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:54,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:54,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:54,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2022-02-21 03:23:54,706 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:23:54,706 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:23:54,706 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:23:54,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:23:54,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:54,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:54,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:54,709 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:23:54,709 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:54,709 INFO L791 eck$LassoCheckResult]: Stem: 90#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 91#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 94#L13-3 assume !(main_~n~0#1 < 10); 89#L17-4 [2022-02-21 03:23:54,710 INFO L793 eck$LassoCheckResult]: Loop: 89#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 87#L17 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 88#L17-2 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 89#L17-4 [2022-02-21 03:23:54,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:54,710 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2022-02-21 03:23:54,710 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:54,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365352214] [2022-02-21 03:23:54,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:54,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:54,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {116#true} is VALID [2022-02-21 03:23:54,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {118#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:23:54,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !(main_~n~0#1 < 10); {117#false} is VALID [2022-02-21 03:23:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:54,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:54,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365352214] [2022-02-21 03:23:54,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365352214] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:23:54,763 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:23:54,763 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:23:54,763 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264346379] [2022-02-21 03:23:54,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:23:54,765 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:54,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:54,766 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2022-02-21 03:23:54,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:54,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678350773] [2022-02-21 03:23:54,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:54,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:54,802 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:54,807 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:54,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:54,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:23:54,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:23:54,972 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:54,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:54,991 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2022-02-21 03:23:54,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:23:54,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:54,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:54,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2022-02-21 03:23:55,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:55,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2022-02-21 03:23:55,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:23:55,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:23:55,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2022-02-21 03:23:55,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:55,002 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-02-21 03:23:55,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2022-02-21 03:23:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-02-21 03:23:55,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:55,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 11 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:55,004 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 11 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:55,004 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:55,004 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2022-02-21 03:23:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2022-02-21 03:23:55,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:55,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:55,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 11 transitions. [2022-02-21 03:23:55,006 INFO L87 Difference]: Start difference. First operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 11 transitions. [2022-02-21 03:23:55,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:55,007 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2022-02-21 03:23:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2022-02-21 03:23:55,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:55,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:55,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:55,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2022-02-21 03:23:55,009 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:23:55,009 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:23:55,009 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:23:55,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2022-02-21 03:23:55,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:55,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:55,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:55,012 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:23:55,012 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:55,012 INFO L791 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 134#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 137#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 135#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 136#L13-3 assume !(main_~n~0#1 < 10); 132#L17-4 [2022-02-21 03:23:55,012 INFO L793 eck$LassoCheckResult]: Loop: 132#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 130#L17 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 131#L17-2 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 132#L17-4 [2022-02-21 03:23:55,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:55,012 INFO L85 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2022-02-21 03:23:55,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:55,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845347021] [2022-02-21 03:23:55,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:55,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {159#true} is VALID [2022-02-21 03:23:55,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {161#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:23:55,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; {161#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:23:55,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {161#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {162#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-21 03:23:55,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {162#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !(main_~n~0#1 < 10); {160#false} is VALID [2022-02-21 03:23:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:55,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:55,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845347021] [2022-02-21 03:23:55,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845347021] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:55,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216154876] [2022-02-21 03:23:55,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:55,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:55,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:55,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:23:55,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:23:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:23:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:55,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {159#true} is VALID [2022-02-21 03:23:55,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {169#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:23:55,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#(<= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; {169#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:23:55,158 INFO L290 TraceCheckUtils]: 3: Hoare triple {169#(<= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {162#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-21 03:23:55,159 INFO L290 TraceCheckUtils]: 4: Hoare triple {162#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !(main_~n~0#1 < 10); {160#false} is VALID [2022-02-21 03:23:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:55,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:55,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {179#(< |ULTIMATE.start_main_~n~0#1| 10)} assume !(main_~n~0#1 < 10); {160#false} is VALID [2022-02-21 03:23:55,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {183#(< |ULTIMATE.start_main_~n~0#1| 9)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {179#(< |ULTIMATE.start_main_~n~0#1| 10)} is VALID [2022-02-21 03:23:55,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#(< |ULTIMATE.start_main_~n~0#1| 9)} assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; {183#(< |ULTIMATE.start_main_~n~0#1| 9)} is VALID [2022-02-21 03:23:55,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {183#(< |ULTIMATE.start_main_~n~0#1| 9)} is VALID [2022-02-21 03:23:55,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {159#true} is VALID [2022-02-21 03:23:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:55,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216154876] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:55,200 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:55,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-02-21 03:23:55,200 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128134811] [2022-02-21 03:23:55,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:55,200 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2022-02-21 03:23:55,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:55,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600752224] [2022-02-21 03:23:55,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:55,210 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:55,215 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:55,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:55,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:23:55,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:23:55,358 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:55,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:55,401 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:23:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:23:55,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:55,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:55,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2022-02-21 03:23:55,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:55,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2022-02-21 03:23:55,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:23:55,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:23:55,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2022-02-21 03:23:55,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:55,415 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:23:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2022-02-21 03:23:55,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 03:23:55,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:55,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 16 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 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-02-21 03:23:55,417 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 16 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 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-02-21 03:23:55,417 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 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-02-21 03:23:55,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:55,417 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:23:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:23:55,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:55,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:55,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 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) Second operand 14 states and 16 transitions. [2022-02-21 03:23:55,418 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 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) Second operand 14 states and 16 transitions. [2022-02-21 03:23:55,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:55,424 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:23:55,424 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:23:55,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:55,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:55,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:55,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 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-02-21 03:23:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-21 03:23:55,427 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:23:55,427 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:23:55,427 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:23:55,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:23:55,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:55,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:55,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:55,429 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2022-02-21 03:23:55,429 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:55,429 INFO L791 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 210#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 213#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 214#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 215#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 211#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 212#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 219#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 218#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 217#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 216#L13-3 assume !(main_~n~0#1 < 10); 208#L17-4 [2022-02-21 03:23:55,429 INFO L793 eck$LassoCheckResult]: Loop: 208#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 206#L17 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 207#L17-2 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 208#L17-4 [2022-02-21 03:23:55,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:55,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 2 times [2022-02-21 03:23:55,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:55,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796177065] [2022-02-21 03:23:55,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:55,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {251#true} is VALID [2022-02-21 03:23:55,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {253#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:23:55,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {253#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; {253#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:23:55,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {253#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {254#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-21 03:23:55,489 INFO L290 TraceCheckUtils]: 4: Hoare triple {254#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; {254#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-21 03:23:55,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {254#(<= |ULTIMATE.start_main_~n~0#1| 1)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {255#(<= |ULTIMATE.start_main_~n~0#1| 2)} is VALID [2022-02-21 03:23:55,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {255#(<= |ULTIMATE.start_main_~n~0#1| 2)} assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; {255#(<= |ULTIMATE.start_main_~n~0#1| 2)} is VALID [2022-02-21 03:23:55,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {255#(<= |ULTIMATE.start_main_~n~0#1| 2)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {256#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-21 03:23:55,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#(<= |ULTIMATE.start_main_~n~0#1| 3)} assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; {256#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-21 03:23:55,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#(<= |ULTIMATE.start_main_~n~0#1| 3)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {257#(<= |ULTIMATE.start_main_~n~0#1| 4)} is VALID [2022-02-21 03:23:55,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {257#(<= |ULTIMATE.start_main_~n~0#1| 4)} assume !(main_~n~0#1 < 10); {252#false} is VALID [2022-02-21 03:23:55,492 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:55,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:55,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796177065] [2022-02-21 03:23:55,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796177065] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:55,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002163213] [2022-02-21 03:23:55,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:23:55,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:55,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:55,502 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:23:55,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:23:55,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:23:55,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:23:55,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:23:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:55,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {251#true} is VALID [2022-02-21 03:23:55,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {264#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:23:55,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#(<= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; {264#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:23:55,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {264#(<= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {254#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-21 03:23:55,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {254#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; {254#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-21 03:23:55,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {254#(<= |ULTIMATE.start_main_~n~0#1| 1)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {255#(<= |ULTIMATE.start_main_~n~0#1| 2)} is VALID [2022-02-21 03:23:55,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {255#(<= |ULTIMATE.start_main_~n~0#1| 2)} assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; {255#(<= |ULTIMATE.start_main_~n~0#1| 2)} is VALID [2022-02-21 03:23:55,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {255#(<= |ULTIMATE.start_main_~n~0#1| 2)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {256#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-21 03:23:55,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#(<= |ULTIMATE.start_main_~n~0#1| 3)} assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; {256#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-21 03:23:55,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#(<= |ULTIMATE.start_main_~n~0#1| 3)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {257#(<= |ULTIMATE.start_main_~n~0#1| 4)} is VALID [2022-02-21 03:23:55,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {257#(<= |ULTIMATE.start_main_~n~0#1| 4)} assume !(main_~n~0#1 < 10); {252#false} is VALID [2022-02-21 03:23:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:55,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:55,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {292#(< |ULTIMATE.start_main_~n~0#1| 10)} assume !(main_~n~0#1 < 10); {252#false} is VALID [2022-02-21 03:23:55,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#(< |ULTIMATE.start_main_~n~0#1| 9)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {292#(< |ULTIMATE.start_main_~n~0#1| 10)} is VALID [2022-02-21 03:23:55,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {296#(< |ULTIMATE.start_main_~n~0#1| 9)} assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; {296#(< |ULTIMATE.start_main_~n~0#1| 9)} is VALID [2022-02-21 03:23:55,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {303#(< |ULTIMATE.start_main_~n~0#1| 8)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {296#(< |ULTIMATE.start_main_~n~0#1| 9)} is VALID [2022-02-21 03:23:55,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {303#(< |ULTIMATE.start_main_~n~0#1| 8)} assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; {303#(< |ULTIMATE.start_main_~n~0#1| 8)} is VALID [2022-02-21 03:23:55,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {310#(< |ULTIMATE.start_main_~n~0#1| 7)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {303#(< |ULTIMATE.start_main_~n~0#1| 8)} is VALID [2022-02-21 03:23:55,760 INFO L290 TraceCheckUtils]: 4: Hoare triple {310#(< |ULTIMATE.start_main_~n~0#1| 7)} assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; {310#(< |ULTIMATE.start_main_~n~0#1| 7)} is VALID [2022-02-21 03:23:55,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {317#(< |ULTIMATE.start_main_~n~0#1| 6)} main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; {310#(< |ULTIMATE.start_main_~n~0#1| 7)} is VALID [2022-02-21 03:23:55,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {317#(< |ULTIMATE.start_main_~n~0#1| 6)} assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; {317#(< |ULTIMATE.start_main_~n~0#1| 6)} is VALID [2022-02-21 03:23:55,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; {317#(< |ULTIMATE.start_main_~n~0#1| 6)} is VALID [2022-02-21 03:23:55,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {251#true} is VALID [2022-02-21 03:23:55,762 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:55,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002163213] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:55,762 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:55,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-02-21 03:23:55,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764156836] [2022-02-21 03:23:55,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:55,763 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:55,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:55,763 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2022-02-21 03:23:55,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:55,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033838242] [2022-02-21 03:23:55,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:55,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:55,772 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:55,777 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:55,896 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:55,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 03:23:55,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:23:55,897 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:55,999 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-02-21 03:23:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:23:55,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:56,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:56,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2022-02-21 03:23:56,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:56,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2022-02-21 03:23:56,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:23:56,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:23:56,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2022-02-21 03:23:56,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:56,020 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-02-21 03:23:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2022-02-21 03:23:56,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-21 03:23:56,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:56,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 28 transitions. Second operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:56,022 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 28 transitions. Second operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:56,022 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:56,023 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-02-21 03:23:56,023 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-21 03:23:56,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:56,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:56,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states and 28 transitions. [2022-02-21 03:23:56,023 INFO L87 Difference]: Start difference. First operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states and 28 transitions. [2022-02-21 03:23:56,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:56,024 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-02-21 03:23:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-21 03:23:56,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:56,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:56,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:56,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-02-21 03:23:56,025 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-02-21 03:23:56,025 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-02-21 03:23:56,025 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:23:56,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2022-02-21 03:23:56,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:56,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:56,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:56,026 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2022-02-21 03:23:56,026 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:56,027 INFO L791 eck$LassoCheckResult]: Stem: 355#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 356#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~pre1#1, main_~n~0#1, main_#t~nondet5#1, main_#t~mem3#1, main_#t~short4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 359#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 360#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 361#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 357#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 358#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 377#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 376#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 375#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 374#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 373#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 372#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 371#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 370#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 369#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 368#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 367#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 366#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 365#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 364#L13-3 assume !!(main_~n~0#1 < 10);call write~int(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet2#1; 363#L13-2 main_#t~pre1#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre1#1; 362#L13-3 assume !(main_~n~0#1 < 10); 354#L17-4 [2022-02-21 03:23:56,027 INFO L793 eck$LassoCheckResult]: Loop: 354#L17-4 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 352#L17 assume main_#t~short4#1;call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 353#L17-2 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 354#L17-4 [2022-02-21 03:23:56,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:56,027 INFO L85 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 3 times [2022-02-21 03:23:56,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:56,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134827552] [2022-02-21 03:23:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:56,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:56,060 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:56,081 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:56,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:56,082 INFO L85 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2022-02-21 03:23:56,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:56,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951513991] [2022-02-21 03:23:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:56,089 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:56,093 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:56,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:56,094 INFO L85 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2022-02-21 03:23:56,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:56,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258587964] [2022-02-21 03:23:56,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:56,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:56,154 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:56,185 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:59,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:23:59 BoogieIcfgContainer [2022-02-21 03:23:59,293 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:23:59,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:23:59,294 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:23:59,294 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:23:59,294 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:53" (3/4) ... [2022-02-21 03:23:59,296 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-02-21 03:23:59,374 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:23:59,374 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:23:59,380 INFO L158 Benchmark]: Toolchain (without parser) took 6612.86ms. Allocated memory was 96.5MB in the beginning and 167.8MB in the end (delta: 71.3MB). Free memory was 64.3MB in the beginning and 72.2MB in the end (delta: -7.9MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2022-02-21 03:23:59,380 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 96.5MB. Free memory is still 51.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:23:59,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.31ms. Allocated memory was 96.5MB in the beginning and 138.4MB in the end (delta: 41.9MB). Free memory was 64.1MB in the beginning and 115.3MB in the end (delta: -51.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:23:59,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.46ms. Allocated memory is still 138.4MB. Free memory was 115.3MB in the beginning and 113.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:23:59,381 INFO L158 Benchmark]: Boogie Preprocessor took 37.86ms. Allocated memory is still 138.4MB. Free memory was 113.6MB in the beginning and 112.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:23:59,381 INFO L158 Benchmark]: RCFGBuilder took 257.15ms. Allocated memory is still 138.4MB. Free memory was 112.4MB in the beginning and 102.4MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:23:59,382 INFO L158 Benchmark]: BuchiAutomizer took 6036.42ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 102.4MB in the beginning and 74.3MB in the end (delta: 28.1MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. [2022-02-21 03:23:59,382 INFO L158 Benchmark]: Witness Printer took 80.02ms. Allocated memory is still 167.8MB. Free memory was 74.3MB in the beginning and 72.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:23:59,383 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 96.5MB. Free memory is still 51.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 164.31ms. Allocated memory was 96.5MB in the beginning and 138.4MB in the end (delta: 41.9MB). Free memory was 64.1MB in the beginning and 115.3MB in the end (delta: -51.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.46ms. Allocated memory is still 138.4MB. Free memory was 115.3MB in the beginning and 113.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.86ms. Allocated memory is still 138.4MB. Free memory was 113.6MB in the beginning and 112.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 257.15ms. Allocated memory is still 138.4MB. Free memory was 112.4MB in the beginning and 102.4MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 6036.42ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 102.4MB in the beginning and 74.3MB in the end (delta: 28.1MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. * Witness Printer took 80.02ms. Allocated memory is still 167.8MB. Free memory was 74.3MB in the beginning and 72.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -8 * n + 19 * unknown-#length-unknown[a] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 5 iterations. TraceHistogramMax:10. Analysis of lassos took 5.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 4. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 26 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital87 mio100 ax100 hnf100 lsp93 ukn64 mio100 lsp65 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 120ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 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 {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3034c979=8, NULL=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59e9e52f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@5d562b31=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@f3e0989=0, NULL=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ac2bb92=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@548ddc37=0, i=8, NULL=0, n=10, a=2} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] a[i] = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-02-21 03:23:59,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:59,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:59,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)