./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cmemchr-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cmemchr-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 007fc8a389a67fb47c7d326d3f1d284696dfe5de13661e77d6d1bf7cce285194 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:35:13,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:35:13,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:35:13,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:35:13,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:35:13,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:35:13,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:35:13,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:35:13,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:35:13,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:35:13,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:35:13,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:35:13,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:35:13,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:35:13,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:35:13,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:35:13,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:35:13,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:35:13,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:35:13,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:35:13,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:35:13,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:35:13,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:35:13,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:35:13,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:35:13,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:35:13,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:35:13,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:35:13,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:35:13,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:35:13,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:35:13,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:35:13,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:35:13,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:35:13,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:35:13,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:35:13,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:35:13,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:35:13,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:35:13,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:35:13,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:35:13,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:35:13,790 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:35:13,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:35:13,791 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:35:13,791 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:35:13,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:35:13,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:35:13,793 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:35:13,794 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:35:13,794 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:35:13,794 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:35:13,795 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:35:13,795 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:35:13,795 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:35:13,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:35:13,796 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:35:13,796 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:35:13,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:35:13,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:35:13,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:35:13,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:35:13,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:35:13,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:35:13,797 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:35:13,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:35:13,798 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:35:13,798 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:35:13,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:35:13,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:35:13,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:35:13,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:35:13,799 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:35:13,800 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:35:13,800 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 007fc8a389a67fb47c7d326d3f1d284696dfe5de13661e77d6d1bf7cce285194 [2022-02-21 04:35:14,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:35:14,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:35:14,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:35:14,051 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:35:14,052 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:35:14,053 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cmemchr-alloca-2.i [2022-02-21 04:35:14,107 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35e953609/ba4fc65b1c15448bacff153b65c81900/FLAGaceff2561 [2022-02-21 04:35:14,522 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:35:14,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cmemchr-alloca-2.i [2022-02-21 04:35:14,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35e953609/ba4fc65b1c15448bacff153b65c81900/FLAGaceff2561 [2022-02-21 04:35:14,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35e953609/ba4fc65b1c15448bacff153b65c81900 [2022-02-21 04:35:14,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:35:14,548 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:35:14,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:14,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:35:14,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:35:14,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:14,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7e6e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14, skipping insertion in model container [2022-02-21 04:35:14,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:14,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:35:14,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:35:14,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:14,876 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:35:14,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:14,930 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:35:14,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14 WrapperNode [2022-02-21 04:35:14,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:14,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:14,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:35:14,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:35:14,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 04:35:14" (1/1) ... [2022-02-21 04:35:14,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:14,986 INFO L137 Inliner]: procedures = 117, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2022-02-21 04:35:14,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:14,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:35:14,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:35:14,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:35:14,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:14,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:15,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:15,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:15,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:15,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:15,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:15,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:35:15,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:35:15,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:35:15,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:35:15,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:15,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:15,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,072 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 04:35:15,079 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 04:35:15,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:35:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:35:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:35:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:35:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:35:15,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:35:15,205 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:35:15,206 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:15,394 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:15,399 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:15,400 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 04:35:15,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:15 BoogieIcfgContainer [2022-02-21 04:35:15,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:15,402 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:15,403 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:15,406 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:15,406 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:15,407 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:35:14" (1/3) ... [2022-02-21 04:35:15,410 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d3f949d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:15, skipping insertion in model container [2022-02-21 04:35:15,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:15,410 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (2/3) ... [2022-02-21 04:35:15,410 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d3f949d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:15, skipping insertion in model container [2022-02-21 04:35:15,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:15,411 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:15" (3/3) ... [2022-02-21 04:35:15,412 INFO L388 chiAutomizerObserver]: Analyzing ICFG openbsd_cmemchr-alloca-2.i [2022-02-21 04:35:15,455 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:15,455 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:15,455 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:15,455 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:15,455 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:15,455 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:15,455 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:15,455 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:15,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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 04:35:15,486 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 04:35:15,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:15,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:15,492 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:15,492 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:15,492 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:15,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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 04:35:15,495 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 04:35:15,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:15,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:15,496 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:15,496 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:15,502 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;main_~length~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~c~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 8#L529true assume !(main_~length~0#1 < 1); 16#L529-2true assume !(main_~n~0#1 < 1); 3#L532-1true call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 7#L537-3true [2022-02-21 04:35:15,502 INFO L793 eck$LassoCheckResult]: Loop: 7#L537-3true assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet10#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 14#L537-2true main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7#L537-3true [2022-02-21 04:35:15,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:15,511 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 04:35:15,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:15,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718855912] [2022-02-21 04:35:15,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:15,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:15,623 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:15,664 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:15,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:15,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-02-21 04:35:15,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:15,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073805773] [2022-02-21 04:35:15,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:15,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:15,700 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:15,715 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:15,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:15,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-02-21 04:35:15,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:15,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858650423] [2022-02-21 04:35:15,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:15,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:15,762 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:15,800 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:16,092 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:16,093 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:16,094 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:16,094 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:16,094 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:16,094 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:16,094 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:16,094 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:16,095 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cmemchr-alloca-2.i_Iteration1_Lasso [2022-02-21 04:35:16,095 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:16,095 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:16,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:16,257 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 04:35:16,260 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 04:35:16,263 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 04:35:16,266 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 04:35:16,269 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 04:35:16,273 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 04:35:16,276 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 04:35:16,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:16,282 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 04:35:16,285 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 04:35:16,287 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 04:35:16,291 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 04:35:16,294 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 04:35:16,297 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 04:35:16,628 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:16,631 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:16,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:16,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:16,635 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 04:35:16,636 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 04:35:16,637 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 04:35:16,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:16,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:16,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:16,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:16,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:16,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:16,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:16,701 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 04:35:16,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:16,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:16,704 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 04:35:16,714 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 04:35:16,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:16,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:16,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:16,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:16,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:16,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:16,744 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 04:35:16,744 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:16,798 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-02-21 04:35:16,798 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-02-21 04:35:16,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:16,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:16,808 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:16,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:35:16,846 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:16,876 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:16,876 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:16,877 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nondetArea~0#1.offset, ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~nondetArea~0#1.base)_1) = -1*ULTIMATE.start_main_~nondetArea~0#1.offset - 1*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~nondetArea~0#1.base)_1 Supporting invariants [] [2022-02-21 04:35:16,903 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 04:35:16,932 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 04:35:16,941 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet10#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;" "main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2022-02-21 04:35:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:16,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:17,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:17,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {28#unseeded} is VALID [2022-02-21 04:35:17,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;main_~length~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~c~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {28#unseeded} is VALID [2022-02-21 04:35:17,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#unseeded} assume !(main_~length~0#1 < 1); {28#unseeded} is VALID [2022-02-21 04:35:17,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#unseeded} assume !(main_~n~0#1 < 1); {28#unseeded} is VALID [2022-02-21 04:35:17,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#unseeded} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; {28#unseeded} is VALID [2022-02-21 04:35:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:17,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:17,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:17,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~nondetArea~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)))} assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet10#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; {73#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~nondetArea~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|))) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetArea~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)))} is VALID [2022-02-21 04:35:17,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {73#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~nondetArea~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|))) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetArea~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|)))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {56#(or (and (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (* (- 1) |ULTIMATE.start_main_~nondetArea~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetArea~0#1.base|))) (>= oldRank0 0)) unseeded)} is VALID [2022-02-21 04:35:17,067 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 04:35:17,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:17,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:17,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:17,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,117 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 04:35:17,119 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:17,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:17,254 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 59 transitions. Complement of second has 7 states. [2022-02-21 04:35:17,255 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 04:35:17,255 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:17,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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 04:35:17,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 04:35:17,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:17,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:17,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:17,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:17,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:17,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:17,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 59 transitions. [2022-02-21 04:35:17,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:17,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:17,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:17,276 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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 04:35:17,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 04:35:17,282 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 04:35:17,282 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:17,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:17,286 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:17,286 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 59 transitions. cyclomatic complexity: 21 [2022-02-21 04:35:17,288 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:35:17,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:17,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:17,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:17,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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 04:35:17,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:17,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:17,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:17,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:17,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:17,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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 42 letters. Loop has 42 letters. [2022-02-21 04:35:17,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 42 letters. [2022-02-21 04:35:17,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 42 letters. Loop has 42 letters. [2022-02-21 04:35:17,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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 18 letters. Loop has 18 letters. [2022-02-21 04:35:17,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 04:35:17,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 18 letters. [2022-02-21 04:35:17,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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 04:35:17,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:17,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:17,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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 10 letters. Loop has 4 letters. [2022-02-21 04:35:17,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 04:35:17,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 4 letters. [2022-02-21 04:35:17,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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 4 letters. [2022-02-21 04:35:17,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:17,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:17,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:17,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:17,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:17,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:17,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:17,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:17,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:17,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:17,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:17,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:17,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:17,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:17,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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 04:35:17,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:17,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:17,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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 04:35:17,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:17,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:17,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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 10 letters. Loop has 4 letters. [2022-02-21 04:35:17,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 04:35:17,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 4 letters. [2022-02-21 04:35:17,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:17,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:17,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:17,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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 4 letters. [2022-02-21 04:35:17,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:17,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:17,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:17,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:17,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 59 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:17,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,329 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:17,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-02-21 04:35:17,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:17,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:17,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:35:17,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:17,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 59 transitions. cyclomatic complexity: 21 [2022-02-21 04:35:17,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:17,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 14 states and 18 transitions. [2022-02-21 04:35:17,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 04:35:17,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 04:35:17,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2022-02-21 04:35:17,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:17,350 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-02-21 04:35:17,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2022-02-21 04:35:17,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 04:35:17,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:17,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 18 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:17,370 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 18 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:17,372 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:17,374 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2022-02-21 04:35:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2022-02-21 04:35:17,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:17,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:17,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 18 transitions. [2022-02-21 04:35:17,375 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 18 transitions. [2022-02-21 04:35:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:17,376 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2022-02-21 04:35:17,376 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2022-02-21 04:35:17,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:17,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:17,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:17,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:17,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2022-02-21 04:35:17,379 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-02-21 04:35:17,379 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-02-21 04:35:17,379 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:17,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2022-02-21 04:35:17,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:17,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:17,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:17,380 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:17,380 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:35:17,381 INFO L791 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 132#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;main_~length~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~c~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 137#L529 assume !(main_~length~0#1 < 1); 138#L529-2 assume !(main_~n~0#1 < 1); 129#L532-1 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 130#L537-3 assume !(main_~i~0#1 < main_~n~0#1); 133#L537-4 assume { :begin_inline_cmemchr } true;cmemchr_#in~s#1.base, cmemchr_#in~s#1.offset, cmemchr_#in~c#1, cmemchr_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemchr_#res#1.base, cmemchr_#res#1.offset;havoc cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset, cmemchr_#t~mem4#1, cmemchr_#t~pre2#1, cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset, cmemchr_~s#1.base, cmemchr_~s#1.offset, cmemchr_~c#1, cmemchr_~n#1;cmemchr_~s#1.base, cmemchr_~s#1.offset := cmemchr_#in~s#1.base, cmemchr_#in~s#1.offset;cmemchr_~c#1 := cmemchr_#in~c#1;cmemchr_~n#1 := cmemchr_#in~n#1; 134#L516 assume 0 != cmemchr_~n#1 % 4294967296;cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset := cmemchr_~s#1.base, cmemchr_~s#1.offset; 139#L518-4 [2022-02-21 04:35:17,381 INFO L793 eck$LassoCheckResult]: Loop: 139#L518-4 cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset := cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset;cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset := cmemchr_#t~post3#1.base, 1 + cmemchr_#t~post3#1.offset;call cmemchr_#t~mem4#1 := read~int(cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset, 1); 140#L519 assume !(cmemchr_#t~mem4#1 % 256 == cmemchr_~c#1 % 256);havoc cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset;havoc cmemchr_#t~mem4#1; 142#L518-1 cmemchr_#t~pre2#1 := cmemchr_~n#1 - 1;cmemchr_~n#1 := cmemchr_~n#1 - 1; 141#L518-2 assume !!(0 != cmemchr_#t~pre2#1 % 4294967296);havoc cmemchr_#t~pre2#1; 139#L518-4 [2022-02-21 04:35:17,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash 180430706, now seen corresponding path program 1 times [2022-02-21 04:35:17,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:17,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015159688] [2022-02-21 04:35:17,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:17,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:17,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {174#true} is VALID [2022-02-21 04:35:17,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;main_~length~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~c~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {174#true} is VALID [2022-02-21 04:35:17,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {174#true} assume !(main_~length~0#1 < 1); {174#true} is VALID [2022-02-21 04:35:17,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {174#true} assume !(main_~n~0#1 < 1); {176#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-21 04:35:17,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {176#(<= 1 |ULTIMATE.start_main_~n~0#1|)} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; {177#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-21 04:35:17,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~0#1 < main_~n~0#1); {175#false} is VALID [2022-02-21 04:35:17,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#false} assume { :begin_inline_cmemchr } true;cmemchr_#in~s#1.base, cmemchr_#in~s#1.offset, cmemchr_#in~c#1, cmemchr_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemchr_#res#1.base, cmemchr_#res#1.offset;havoc cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset, cmemchr_#t~mem4#1, cmemchr_#t~pre2#1, cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset, cmemchr_~s#1.base, cmemchr_~s#1.offset, cmemchr_~c#1, cmemchr_~n#1;cmemchr_~s#1.base, cmemchr_~s#1.offset := cmemchr_#in~s#1.base, cmemchr_#in~s#1.offset;cmemchr_~c#1 := cmemchr_#in~c#1;cmemchr_~n#1 := cmemchr_#in~n#1; {175#false} is VALID [2022-02-21 04:35:17,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#false} assume 0 != cmemchr_~n#1 % 4294967296;cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset := cmemchr_~s#1.base, cmemchr_~s#1.offset; {175#false} is VALID [2022-02-21 04:35:17,438 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 04:35:17,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:17,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015159688] [2022-02-21 04:35:17,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015159688] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:17,439 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:17,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:35:17,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406592195] [2022-02-21 04:35:17,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:17,442 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:17,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:17,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2036779, now seen corresponding path program 1 times [2022-02-21 04:35:17,445 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:17,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658907624] [2022-02-21 04:35:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:17,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:17,471 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:17,496 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:17,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:17,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:35:17,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:35:17,579 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:17,628 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-02-21 04:35:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:35:17,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:17,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:17,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2022-02-21 04:35:17,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:17,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 18 transitions. [2022-02-21 04:35:17,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 04:35:17,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 04:35:17,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2022-02-21 04:35:17,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:17,640 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-02-21 04:35:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2022-02-21 04:35:17,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-02-21 04:35:17,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:17,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 18 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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 04:35:17,641 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 18 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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 04:35:17,641 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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 04:35:17,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:17,642 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-02-21 04:35:17,642 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-02-21 04:35:17,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:17,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:17,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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 15 states and 18 transitions. [2022-02-21 04:35:17,643 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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 15 states and 18 transitions. [2022-02-21 04:35:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:17,644 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-02-21 04:35:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-02-21 04:35:17,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:17,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:17,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:17,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:17,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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 04:35:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2022-02-21 04:35:17,645 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-02-21 04:35:17,646 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-02-21 04:35:17,646 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:17,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2022-02-21 04:35:17,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:17,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:17,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:17,647 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:17,647 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:35:17,647 INFO L791 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 198#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;main_~length~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~c~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 203#L529 assume !(main_~length~0#1 < 1); 204#L529-2 assume !(main_~n~0#1 < 1); 195#L532-1 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 196#L537-3 assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet10#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 201#L537-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 202#L537-3 assume !(main_~i~0#1 < main_~n~0#1); 199#L537-4 assume { :begin_inline_cmemchr } true;cmemchr_#in~s#1.base, cmemchr_#in~s#1.offset, cmemchr_#in~c#1, cmemchr_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemchr_#res#1.base, cmemchr_#res#1.offset;havoc cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset, cmemchr_#t~mem4#1, cmemchr_#t~pre2#1, cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset, cmemchr_~s#1.base, cmemchr_~s#1.offset, cmemchr_~c#1, cmemchr_~n#1;cmemchr_~s#1.base, cmemchr_~s#1.offset := cmemchr_#in~s#1.base, cmemchr_#in~s#1.offset;cmemchr_~c#1 := cmemchr_#in~c#1;cmemchr_~n#1 := cmemchr_#in~n#1; 200#L516 assume 0 != cmemchr_~n#1 % 4294967296;cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset := cmemchr_~s#1.base, cmemchr_~s#1.offset; 205#L518-4 [2022-02-21 04:35:17,647 INFO L793 eck$LassoCheckResult]: Loop: 205#L518-4 cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset := cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset;cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset := cmemchr_#t~post3#1.base, 1 + cmemchr_#t~post3#1.offset;call cmemchr_#t~mem4#1 := read~int(cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset, 1); 206#L519 assume !(cmemchr_#t~mem4#1 % 256 == cmemchr_~c#1 % 256);havoc cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset;havoc cmemchr_#t~mem4#1; 208#L518-1 cmemchr_#t~pre2#1 := cmemchr_~n#1 - 1;cmemchr_~n#1 := cmemchr_~n#1 - 1; 207#L518-2 assume !!(0 != cmemchr_#t~pre2#1 % 4294967296);havoc cmemchr_#t~pre2#1; 205#L518-4 [2022-02-21 04:35:17,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:17,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1596934864, now seen corresponding path program 1 times [2022-02-21 04:35:17,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:17,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514153380] [2022-02-21 04:35:17,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:17,663 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:17,674 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:17,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:17,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2036779, now seen corresponding path program 2 times [2022-02-21 04:35:17,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:17,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835509490] [2022-02-21 04:35:17,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:17,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:17,687 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:17,694 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:17,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:17,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1308516218, now seen corresponding path program 1 times [2022-02-21 04:35:17,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:17,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139023574] [2022-02-21 04:35:17,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:17,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:17,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {246#true} is VALID [2022-02-21 04:35:17,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;main_~length~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~c~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {246#true} is VALID [2022-02-21 04:35:17,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume !(main_~length~0#1 < 1); {246#true} is VALID [2022-02-21 04:35:17,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {246#true} assume !(main_~n~0#1 < 1); {248#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-21 04:35:17,844 INFO L290 TraceCheckUtils]: 4: Hoare triple {248#(<= 1 |ULTIMATE.start_main_~n~0#1|)} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; {249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-21 04:35:17,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet10#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; {249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-21 04:35:17,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {250#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 04:35:17,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~i~0#1 < main_~n~0#1); {251#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-21 04:35:17,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {251#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume { :begin_inline_cmemchr } true;cmemchr_#in~s#1.base, cmemchr_#in~s#1.offset, cmemchr_#in~c#1, cmemchr_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemchr_#res#1.base, cmemchr_#res#1.offset;havoc cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset, cmemchr_#t~mem4#1, cmemchr_#t~pre2#1, cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset, cmemchr_~s#1.base, cmemchr_~s#1.offset, cmemchr_~c#1, cmemchr_~n#1;cmemchr_~s#1.base, cmemchr_~s#1.offset := cmemchr_#in~s#1.base, cmemchr_#in~s#1.offset;cmemchr_~c#1 := cmemchr_#in~c#1;cmemchr_~n#1 := cmemchr_#in~n#1; {252#(and (<= |ULTIMATE.start_cmemchr_~n#1| 1) (<= 1 |ULTIMATE.start_cmemchr_~n#1|))} is VALID [2022-02-21 04:35:17,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {252#(and (<= |ULTIMATE.start_cmemchr_~n#1| 1) (<= 1 |ULTIMATE.start_cmemchr_~n#1|))} assume 0 != cmemchr_~n#1 % 4294967296;cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset := cmemchr_~s#1.base, cmemchr_~s#1.offset; {252#(and (<= |ULTIMATE.start_cmemchr_~n#1| 1) (<= 1 |ULTIMATE.start_cmemchr_~n#1|))} is VALID [2022-02-21 04:35:17,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#(and (<= |ULTIMATE.start_cmemchr_~n#1| 1) (<= 1 |ULTIMATE.start_cmemchr_~n#1|))} cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset := cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset;cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset := cmemchr_#t~post3#1.base, 1 + cmemchr_#t~post3#1.offset;call cmemchr_#t~mem4#1 := read~int(cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset, 1); {252#(and (<= |ULTIMATE.start_cmemchr_~n#1| 1) (<= 1 |ULTIMATE.start_cmemchr_~n#1|))} is VALID [2022-02-21 04:35:17,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#(and (<= |ULTIMATE.start_cmemchr_~n#1| 1) (<= 1 |ULTIMATE.start_cmemchr_~n#1|))} assume !(cmemchr_#t~mem4#1 % 256 == cmemchr_~c#1 % 256);havoc cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset;havoc cmemchr_#t~mem4#1; {252#(and (<= |ULTIMATE.start_cmemchr_~n#1| 1) (<= 1 |ULTIMATE.start_cmemchr_~n#1|))} is VALID [2022-02-21 04:35:17,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#(and (<= |ULTIMATE.start_cmemchr_~n#1| 1) (<= 1 |ULTIMATE.start_cmemchr_~n#1|))} cmemchr_#t~pre2#1 := cmemchr_~n#1 - 1;cmemchr_~n#1 := cmemchr_~n#1 - 1; {253#(and (<= |ULTIMATE.start_cmemchr_#t~pre2#1| (* (div |ULTIMATE.start_cmemchr_#t~pre2#1| 4294967296) 4294967296)) (<= 0 |ULTIMATE.start_cmemchr_#t~pre2#1|))} is VALID [2022-02-21 04:35:17,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {253#(and (<= |ULTIMATE.start_cmemchr_#t~pre2#1| (* (div |ULTIMATE.start_cmemchr_#t~pre2#1| 4294967296) 4294967296)) (<= 0 |ULTIMATE.start_cmemchr_#t~pre2#1|))} assume !!(0 != cmemchr_#t~pre2#1 % 4294967296);havoc cmemchr_#t~pre2#1; {247#false} is VALID [2022-02-21 04:35:17,853 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 04:35:17,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:17,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139023574] [2022-02-21 04:35:17,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139023574] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:35:17,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571430214] [2022-02-21 04:35:17,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:17,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:17,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:17,855 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 04:35:17,871 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 04:35:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:17,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 04:35:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:17,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:18,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {246#true} is VALID [2022-02-21 04:35:18,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;main_~length~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~c~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {246#true} is VALID [2022-02-21 04:35:18,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume !(main_~length~0#1 < 1); {246#true} is VALID [2022-02-21 04:35:18,059 INFO L290 TraceCheckUtils]: 3: Hoare triple {246#true} assume !(main_~n~0#1 < 1); {248#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-21 04:35:18,059 INFO L290 TraceCheckUtils]: 4: Hoare triple {248#(<= 1 |ULTIMATE.start_main_~n~0#1|)} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; {249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-21 04:35:18,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet10#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; {249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-21 04:35:18,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {249#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {275#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-21 04:35:18,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {275#(and (= |ULTIMATE.start_main_~i~0#1| 1) (<= 1 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~0#1 < main_~n~0#1); {251#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-21 04:35:18,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {251#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume { :begin_inline_cmemchr } true;cmemchr_#in~s#1.base, cmemchr_#in~s#1.offset, cmemchr_#in~c#1, cmemchr_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemchr_#res#1.base, cmemchr_#res#1.offset;havoc cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset, cmemchr_#t~mem4#1, cmemchr_#t~pre2#1, cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset, cmemchr_~s#1.base, cmemchr_~s#1.offset, cmemchr_~c#1, cmemchr_~n#1;cmemchr_~s#1.base, cmemchr_~s#1.offset := cmemchr_#in~s#1.base, cmemchr_#in~s#1.offset;cmemchr_~c#1 := cmemchr_#in~c#1;cmemchr_~n#1 := cmemchr_#in~n#1; {252#(and (<= |ULTIMATE.start_cmemchr_~n#1| 1) (<= 1 |ULTIMATE.start_cmemchr_~n#1|))} is VALID [2022-02-21 04:35:18,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {252#(and (<= |ULTIMATE.start_cmemchr_~n#1| 1) (<= 1 |ULTIMATE.start_cmemchr_~n#1|))} assume 0 != cmemchr_~n#1 % 4294967296;cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset := cmemchr_~s#1.base, cmemchr_~s#1.offset; {252#(and (<= |ULTIMATE.start_cmemchr_~n#1| 1) (<= 1 |ULTIMATE.start_cmemchr_~n#1|))} is VALID [2022-02-21 04:35:18,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#(and (<= |ULTIMATE.start_cmemchr_~n#1| 1) (<= 1 |ULTIMATE.start_cmemchr_~n#1|))} cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset := cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset;cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset := cmemchr_#t~post3#1.base, 1 + cmemchr_#t~post3#1.offset;call cmemchr_#t~mem4#1 := read~int(cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset, 1); {252#(and (<= |ULTIMATE.start_cmemchr_~n#1| 1) (<= 1 |ULTIMATE.start_cmemchr_~n#1|))} is VALID [2022-02-21 04:35:18,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#(and (<= |ULTIMATE.start_cmemchr_~n#1| 1) (<= 1 |ULTIMATE.start_cmemchr_~n#1|))} assume !(cmemchr_#t~mem4#1 % 256 == cmemchr_~c#1 % 256);havoc cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset;havoc cmemchr_#t~mem4#1; {252#(and (<= |ULTIMATE.start_cmemchr_~n#1| 1) (<= 1 |ULTIMATE.start_cmemchr_~n#1|))} is VALID [2022-02-21 04:35:18,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#(and (<= |ULTIMATE.start_cmemchr_~n#1| 1) (<= 1 |ULTIMATE.start_cmemchr_~n#1|))} cmemchr_#t~pre2#1 := cmemchr_~n#1 - 1;cmemchr_~n#1 := cmemchr_~n#1 - 1; {294#(and (<= |ULTIMATE.start_cmemchr_#t~pre2#1| 0) (<= 0 |ULTIMATE.start_cmemchr_#t~pre2#1|))} is VALID [2022-02-21 04:35:18,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#(and (<= |ULTIMATE.start_cmemchr_#t~pre2#1| 0) (<= 0 |ULTIMATE.start_cmemchr_#t~pre2#1|))} assume !!(0 != cmemchr_#t~pre2#1 % 4294967296);havoc cmemchr_#t~pre2#1; {247#false} is VALID [2022-02-21 04:35:18,066 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 04:35:18,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:35:18,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {298#(= (mod |ULTIMATE.start_cmemchr_#t~pre2#1| 4294967296) 0)} assume !!(0 != cmemchr_#t~pre2#1 % 4294967296);havoc cmemchr_#t~pre2#1; {247#false} is VALID [2022-02-21 04:35:18,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {302#(= (mod (+ 4294967295 |ULTIMATE.start_cmemchr_~n#1|) 4294967296) 0)} cmemchr_#t~pre2#1 := cmemchr_~n#1 - 1;cmemchr_~n#1 := cmemchr_~n#1 - 1; {298#(= (mod |ULTIMATE.start_cmemchr_#t~pre2#1| 4294967296) 0)} is VALID [2022-02-21 04:35:18,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {302#(= (mod (+ 4294967295 |ULTIMATE.start_cmemchr_~n#1|) 4294967296) 0)} assume !(cmemchr_#t~mem4#1 % 256 == cmemchr_~c#1 % 256);havoc cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset;havoc cmemchr_#t~mem4#1; {302#(= (mod (+ 4294967295 |ULTIMATE.start_cmemchr_~n#1|) 4294967296) 0)} is VALID [2022-02-21 04:35:18,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {302#(= (mod (+ 4294967295 |ULTIMATE.start_cmemchr_~n#1|) 4294967296) 0)} cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset := cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset;cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset := cmemchr_#t~post3#1.base, 1 + cmemchr_#t~post3#1.offset;call cmemchr_#t~mem4#1 := read~int(cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset, 1); {302#(= (mod (+ 4294967295 |ULTIMATE.start_cmemchr_~n#1|) 4294967296) 0)} is VALID [2022-02-21 04:35:18,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {302#(= (mod (+ 4294967295 |ULTIMATE.start_cmemchr_~n#1|) 4294967296) 0)} assume 0 != cmemchr_~n#1 % 4294967296;cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset := cmemchr_~s#1.base, cmemchr_~s#1.offset; {302#(= (mod (+ 4294967295 |ULTIMATE.start_cmemchr_~n#1|) 4294967296) 0)} is VALID [2022-02-21 04:35:18,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {315#(= (mod (+ 4294967295 |ULTIMATE.start_main_~n~0#1|) 4294967296) 0)} assume { :begin_inline_cmemchr } true;cmemchr_#in~s#1.base, cmemchr_#in~s#1.offset, cmemchr_#in~c#1, cmemchr_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemchr_#res#1.base, cmemchr_#res#1.offset;havoc cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset, cmemchr_#t~mem4#1, cmemchr_#t~pre2#1, cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset, cmemchr_~s#1.base, cmemchr_~s#1.offset, cmemchr_~c#1, cmemchr_~n#1;cmemchr_~s#1.base, cmemchr_~s#1.offset := cmemchr_#in~s#1.base, cmemchr_#in~s#1.offset;cmemchr_~c#1 := cmemchr_#in~c#1;cmemchr_~n#1 := cmemchr_#in~n#1; {302#(= (mod (+ 4294967295 |ULTIMATE.start_cmemchr_~n#1|) 4294967296) 0)} is VALID [2022-02-21 04:35:18,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {319#(or (= (mod (+ 4294967295 |ULTIMATE.start_main_~n~0#1|) 4294967296) 0) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~0#1 < main_~n~0#1); {315#(= (mod (+ 4294967295 |ULTIMATE.start_main_~n~0#1|) 4294967296) 0)} is VALID [2022-02-21 04:35:18,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {323#(or (= (mod (+ 4294967295 |ULTIMATE.start_main_~n~0#1|) 4294967296) 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {319#(or (= (mod (+ 4294967295 |ULTIMATE.start_main_~n~0#1|) 4294967296) 0) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-21 04:35:18,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {323#(or (= (mod (+ 4294967295 |ULTIMATE.start_main_~n~0#1|) 4294967296) 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet10#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; {323#(or (= (mod (+ 4294967295 |ULTIMATE.start_main_~n~0#1|) 4294967296) 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-21 04:35:18,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {330#(or (= (mod (+ 4294967295 |ULTIMATE.start_main_~n~0#1|) 4294967296) 0) (< 1 |ULTIMATE.start_main_~n~0#1|))} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; {323#(or (= (mod (+ 4294967295 |ULTIMATE.start_main_~n~0#1|) 4294967296) 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-21 04:35:18,393 INFO L290 TraceCheckUtils]: 3: Hoare triple {246#true} assume !(main_~n~0#1 < 1); {330#(or (= (mod (+ 4294967295 |ULTIMATE.start_main_~n~0#1|) 4294967296) 0) (< 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-21 04:35:18,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume !(main_~length~0#1 < 1); {246#true} is VALID [2022-02-21 04:35:18,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;main_~length~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~c~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {246#true} is VALID [2022-02-21 04:35:18,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {246#true} is VALID [2022-02-21 04:35:18,394 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 04:35:18,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571430214] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:35:18,394 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:35:18,394 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-02-21 04:35:18,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526329030] [2022-02-21 04:35:18,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:35:18,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:18,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 04:35:18,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-02-21 04:35:18,466 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 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 04:35:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:18,733 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-21 04:35:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 04:35:18,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 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 04:35:18,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:18,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2022-02-21 04:35:18,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:18,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 17 states and 19 transitions. [2022-02-21 04:35:18,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 04:35:18,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 04:35:18,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2022-02-21 04:35:18,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:18,779 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-21 04:35:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2022-02-21 04:35:18,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-21 04:35:18,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:18,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 19 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:18,781 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 19 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:18,781 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:18,782 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 04:35:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-21 04:35:18,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:18,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:18,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 19 transitions. [2022-02-21 04:35:18,783 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states and 19 transitions. [2022-02-21 04:35:18,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:18,784 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 04:35:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-21 04:35:18,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:18,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:18,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:18,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:18,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:18,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-02-21 04:35:18,785 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-02-21 04:35:18,785 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-02-21 04:35:18,785 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:18,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2022-02-21 04:35:18,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:18,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:18,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:18,786 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:18,786 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:35:18,786 INFO L791 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 380#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;main_~length~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~c~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 386#L529 assume !(main_~length~0#1 < 1); 387#L529-2 assume !(main_~n~0#1 < 1); 377#L532-1 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 378#L537-3 assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet10#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 383#L537-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 384#L537-3 assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet10#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 385#L537-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 391#L537-3 assume !(main_~i~0#1 < main_~n~0#1); 381#L537-4 assume { :begin_inline_cmemchr } true;cmemchr_#in~s#1.base, cmemchr_#in~s#1.offset, cmemchr_#in~c#1, cmemchr_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemchr_#res#1.base, cmemchr_#res#1.offset;havoc cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset, cmemchr_#t~mem4#1, cmemchr_#t~pre2#1, cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset, cmemchr_~s#1.base, cmemchr_~s#1.offset, cmemchr_~c#1, cmemchr_~n#1;cmemchr_~s#1.base, cmemchr_~s#1.offset := cmemchr_#in~s#1.base, cmemchr_#in~s#1.offset;cmemchr_~c#1 := cmemchr_#in~c#1;cmemchr_~n#1 := cmemchr_#in~n#1; 382#L516 assume 0 != cmemchr_~n#1 % 4294967296;cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset := cmemchr_~s#1.base, cmemchr_~s#1.offset; 388#L518-4 [2022-02-21 04:35:18,787 INFO L793 eck$LassoCheckResult]: Loop: 388#L518-4 cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset := cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset;cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset := cmemchr_#t~post3#1.base, 1 + cmemchr_#t~post3#1.offset;call cmemchr_#t~mem4#1 := read~int(cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset, 1); 389#L519 assume !(cmemchr_#t~mem4#1 % 256 == cmemchr_~c#1 % 256);havoc cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset;havoc cmemchr_#t~mem4#1; 392#L518-1 cmemchr_#t~pre2#1 := cmemchr_~n#1 - 1;cmemchr_~n#1 := cmemchr_~n#1 - 1; 390#L518-2 assume !!(0 != cmemchr_#t~pre2#1 % 4294967296);havoc cmemchr_#t~pre2#1; 388#L518-4 [2022-02-21 04:35:18,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:18,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1352797870, now seen corresponding path program 2 times [2022-02-21 04:35:18,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:18,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349781925] [2022-02-21 04:35:18,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:18,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:18,812 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:18,843 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:18,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:18,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2036779, now seen corresponding path program 3 times [2022-02-21 04:35:18,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:18,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604767405] [2022-02-21 04:35:18,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:18,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:18,861 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:18,871 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:18,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:18,873 INFO L85 PathProgramCache]: Analyzing trace with hash -24116136, now seen corresponding path program 2 times [2022-02-21 04:35:18,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:18,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700883787] [2022-02-21 04:35:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:18,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:18,920 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:18,941 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:19,405 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:19,406 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:19,406 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:19,406 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:19,406 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:19,406 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:19,406 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:19,406 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:19,406 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cmemchr-alloca-2.i_Iteration4_Lasso [2022-02-21 04:35:19,406 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:19,406 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:19,409 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 04:35:19,766 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:19,767 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:19,770 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 04:35:19,773 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 04:35:19,775 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 04:35:19,777 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 04:35:19,781 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 04:35:19,783 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 04:35:19,790 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 04:35:19,792 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 04:35:19,793 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 04:35:19,796 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 04:35:19,798 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 04:35:19,799 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 04:35:19,802 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 04:35:19,808 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 04:35:19,810 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 04:35:19,812 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 04:35:19,814 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 04:35:19,816 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 04:35:19,819 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 04:35:19,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:20,570 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:20,570 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:20,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:20,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:20,575 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:20,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:35:20,577 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 04:35:20,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:20,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:20,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:20,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:20,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:20,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:20,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:20,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:20,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:20,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:20,631 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:20,638 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 04:35:20,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:20,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:20,646 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 04:35:20,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:20,659 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 04:35:20,659 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:35:20,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:35:20,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:20,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:20,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:20,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:20,699 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:20,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:35:20,701 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 04:35:20,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:20,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:20,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:20,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:20,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:20,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:20,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:20,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:20,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:20,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:20,742 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:20,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:35:20,744 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 04:35:20,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:20,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:20,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:20,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:20,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:20,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:20,781 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:20,813 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-02-21 04:35:20,813 INFO L444 ModelExtractionUtils]: 9 out of 40 variables were initially zero. Simplification set additionally 28 variables to zero. [2022-02-21 04:35:20,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:20,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:20,819 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:20,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:35:20,826 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:20,853 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:20,853 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:20,853 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_2, ULTIMATE.start_cmemchr_~p~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_2 - 1*ULTIMATE.start_cmemchr_~p~0#1.offset Supporting invariants [] [2022-02-21 04:35:20,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:20,899 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:35:20,905 INFO L390 LassoCheck]: Loop: "cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset := cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset;cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset := cmemchr_#t~post3#1.base, 1 + cmemchr_#t~post3#1.offset;call cmemchr_#t~mem4#1 := read~int(cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset, 1);" "assume !(cmemchr_#t~mem4#1 % 256 == cmemchr_~c#1 % 256);havoc cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset;havoc cmemchr_#t~mem4#1;" "cmemchr_#t~pre2#1 := cmemchr_~n#1 - 1;cmemchr_~n#1 := cmemchr_~n#1 - 1;" "assume !!(0 != cmemchr_#t~pre2#1 % 4294967296);havoc cmemchr_#t~pre2#1;" [2022-02-21 04:35:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:20,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:20,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:35:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:20,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:21,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {436#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {436#unseeded} is VALID [2022-02-21 04:35:21,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {436#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;main_~length~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~c~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {436#unseeded} is VALID [2022-02-21 04:35:21,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {436#unseeded} assume !(main_~length~0#1 < 1); {436#unseeded} is VALID [2022-02-21 04:35:21,037 INFO L290 TraceCheckUtils]: 3: Hoare triple {436#unseeded} assume !(main_~n~0#1 < 1); {436#unseeded} is VALID [2022-02-21 04:35:21,038 INFO L290 TraceCheckUtils]: 4: Hoare triple {436#unseeded} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; {501#(and unseeded (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetArea~0#1.base|))} is VALID [2022-02-21 04:35:21,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {501#(and unseeded (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetArea~0#1.base|))} assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet10#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; {501#(and unseeded (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetArea~0#1.base|))} is VALID [2022-02-21 04:35:21,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {501#(and unseeded (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetArea~0#1.base|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {501#(and unseeded (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetArea~0#1.base|))} is VALID [2022-02-21 04:35:21,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {501#(and unseeded (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetArea~0#1.base|))} assume !!(main_~i~0#1 < main_~n~0#1);call write~int(main_#t~nondet10#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; {501#(and unseeded (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetArea~0#1.base|))} is VALID [2022-02-21 04:35:21,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {501#(and unseeded (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetArea~0#1.base|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {501#(and unseeded (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetArea~0#1.base|))} is VALID [2022-02-21 04:35:21,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {501#(and unseeded (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetArea~0#1.base|))} assume !(main_~i~0#1 < main_~n~0#1); {501#(and unseeded (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetArea~0#1.base|))} is VALID [2022-02-21 04:35:21,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {501#(and unseeded (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetArea~0#1.base|))} assume { :begin_inline_cmemchr } true;cmemchr_#in~s#1.base, cmemchr_#in~s#1.offset, cmemchr_#in~c#1, cmemchr_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemchr_#res#1.base, cmemchr_#res#1.offset;havoc cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset, cmemchr_#t~mem4#1, cmemchr_#t~pre2#1, cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset, cmemchr_~s#1.base, cmemchr_~s#1.offset, cmemchr_~c#1, cmemchr_~n#1;cmemchr_~s#1.base, cmemchr_~s#1.offset := cmemchr_#in~s#1.base, cmemchr_#in~s#1.offset;cmemchr_~c#1 := cmemchr_#in~c#1;cmemchr_~n#1 := cmemchr_#in~n#1; {520#(and (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_cmemchr_~s#1.base|) unseeded)} is VALID [2022-02-21 04:35:21,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {520#(and (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_cmemchr_~s#1.base|) unseeded)} assume 0 != cmemchr_~n#1 % 4294967296;cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset := cmemchr_~s#1.base, cmemchr_~s#1.offset; {480#(and unseeded (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_cmemchr_~p~0#1.base|))} is VALID [2022-02-21 04:35:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:21,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:35:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:21,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:21,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {481#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) (* (- 1) |ULTIMATE.start_cmemchr_~p~0#1.offset|))) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_cmemchr_~p~0#1.base|))} cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset := cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset;cmemchr_~p~0#1.base, cmemchr_~p~0#1.offset := cmemchr_#t~post3#1.base, 1 + cmemchr_#t~post3#1.offset;call cmemchr_#t~mem4#1 := read~int(cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset, 1); {524#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) 1) (+ |ULTIMATE.start_cmemchr_~p~0#1.offset| oldRank0)) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) 1) (+ oldRank0 (select |#length| |ULTIMATE.start_cmemchr_~p~0#1.base|))) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_cmemchr_~p~0#1.base|))} is VALID [2022-02-21 04:35:21,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) 1) (+ |ULTIMATE.start_cmemchr_~p~0#1.offset| oldRank0)) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) 1) (+ oldRank0 (select |#length| |ULTIMATE.start_cmemchr_~p~0#1.base|))) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_cmemchr_~p~0#1.base|))} assume !(cmemchr_#t~mem4#1 % 256 == cmemchr_~c#1 % 256);havoc cmemchr_#t~post3#1.base, cmemchr_#t~post3#1.offset;havoc cmemchr_#t~mem4#1; {524#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) 1) (+ |ULTIMATE.start_cmemchr_~p~0#1.offset| oldRank0)) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) 1) (+ oldRank0 (select |#length| |ULTIMATE.start_cmemchr_~p~0#1.base|))) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_cmemchr_~p~0#1.base|))} is VALID [2022-02-21 04:35:21,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) 1) (+ |ULTIMATE.start_cmemchr_~p~0#1.offset| oldRank0)) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) 1) (+ oldRank0 (select |#length| |ULTIMATE.start_cmemchr_~p~0#1.base|))) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_cmemchr_~p~0#1.base|))} cmemchr_#t~pre2#1 := cmemchr_~n#1 - 1;cmemchr_~n#1 := cmemchr_~n#1 - 1; {524#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) 1) (+ |ULTIMATE.start_cmemchr_~p~0#1.offset| oldRank0)) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) 1) (+ oldRank0 (select |#length| |ULTIMATE.start_cmemchr_~p~0#1.base|))) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_cmemchr_~p~0#1.base|))} is VALID [2022-02-21 04:35:21,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {524#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) 1) (+ |ULTIMATE.start_cmemchr_~p~0#1.offset| oldRank0)) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) 1) (+ oldRank0 (select |#length| |ULTIMATE.start_cmemchr_~p~0#1.base|))) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_cmemchr_~p~0#1.base|))} assume !!(0 != cmemchr_#t~pre2#1 % 4294967296);havoc cmemchr_#t~pre2#1; {483#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) (* (- 1) |ULTIMATE.start_cmemchr_~p~0#1.offset|)))) unseeded) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_cmemchr_~p~0#1.base|))} is VALID [2022-02-21 04:35:21,173 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 04:35:21,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:21,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:21,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:21,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,205 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-02-21 04:35:21,205 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:21,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:21,270 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 4. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 22 transitions. Complement of second has 6 states. [2022-02-21 04:35:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:21,270 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:21,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. cyclomatic complexity: 4 [2022-02-21 04:35:21,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:21,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:21,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:21,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:21,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:21,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:21,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2022-02-21 04:35:21,273 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:21,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:21,273 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 18 transitions. cyclomatic complexity: 4 [2022-02-21 04:35:21,274 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:35:21,274 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:21,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:21,275 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:21,275 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 22 transitions. cyclomatic complexity: 4 [2022-02-21 04:35:21,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. cyclomatic complexity: 4 [2022-02-21 04:35:21,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:21,275 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:35:21,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:21,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:21,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:21,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 1 letters. [2022-02-21 04:35:21,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 04:35:21,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 1 letters. [2022-02-21 04:35:21,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:35:21,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:35:21,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:35:21,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:21,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:21,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:21,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:21,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:21,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:21,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:21,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:21,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:21,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:35:21,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:35:21,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:35:21,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:35:21,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:35:21,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:35:21,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:35:21,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:35:21,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:35:21,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 1 letters. [2022-02-21 04:35:21,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 04:35:21,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 1 letters. [2022-02-21 04:35:21,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,284 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-02-21 04:35:21,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:21,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:35:21,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 12 letters. Loop has 8 letters. [2022-02-21 04:35:21,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:21,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. cyclomatic complexity: 4 [2022-02-21 04:35:21,287 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:21,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2022-02-21 04:35:21,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:35:21,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:35:21,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:35:21,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:21,288 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:21,288 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:21,288 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:21,288 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:35:21,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:35:21,288 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:21,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:21,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:35:21 BoogieIcfgContainer [2022-02-21 04:35:21,295 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:35:21,295 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:35:21,295 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:35:21,296 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:35:21,296 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:15" (3/4) ... [2022-02-21 04:35:21,298 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:35:21,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:35:21,300 INFO L158 Benchmark]: Toolchain (without parser) took 6751.71ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 70.4MB in the beginning and 97.4MB in the end (delta: -26.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-21 04:35:21,300 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory is still 71.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:21,300 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.88ms. Allocated memory is still 94.4MB. Free memory was 70.2MB in the beginning and 53.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-21 04:35:21,301 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.30ms. Allocated memory is still 94.4MB. Free memory was 53.4MB in the beginning and 51.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:21,301 INFO L158 Benchmark]: Boogie Preprocessor took 47.19ms. Allocated memory is still 94.4MB. Free memory was 51.5MB in the beginning and 50.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:21,301 INFO L158 Benchmark]: RCFGBuilder took 365.31ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 50.0MB in the beginning and 88.9MB in the end (delta: -38.9MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:21,302 INFO L158 Benchmark]: BuchiAutomizer took 5892.46ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 88.8MB in the beginning and 98.4MB in the end (delta: -9.7MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2022-02-21 04:35:21,302 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 136.3MB. Free memory was 98.4MB in the beginning and 97.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:21,304 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.19ms. Allocated memory is still 94.4MB. Free memory is still 71.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.88ms. Allocated memory is still 94.4MB. Free memory was 70.2MB in the beginning and 53.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.30ms. Allocated memory is still 94.4MB. Free memory was 53.4MB in the beginning and 51.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.19ms. Allocated memory is still 94.4MB. Free memory was 51.5MB in the beginning and 50.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 365.31ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 50.0MB in the beginning and 88.9MB in the end (delta: -38.9MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 5892.46ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 88.8MB in the beginning and 98.4MB in the end (delta: -9.7MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 136.3MB. Free memory was 98.4MB in the beginning and 97.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + -1 * nondetArea + unknown-#length-unknown[nondetArea] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] + -1 * p and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.8s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 4.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 90 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89 IncrementalHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 49 mSDtfsCounter, 89 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital126 mio100 ax115 hnf100 lsp79 ukn93 mio100 lsp55 div125 bol100 ite100 ukn100 eq173 hnf90 smp86 dnf100 smp100 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 51ms VariablesStem: 6 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:35:21,332 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 04:35:21,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE