./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/strlcpy.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-dietlibc/strlcpy.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fd4754e908bed6ae29d10e34d903201d1cfa0296 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:32:00,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:32:00,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:32:00,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:32:00,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:32:00,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:32:00,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:32:00,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:32:00,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:32:00,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:32:00,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:32:00,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:32:00,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:32:00,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:32:00,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:32:00,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:32:00,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:32:00,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:32:00,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:32:00,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:32:00,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:32:00,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:32:00,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:32:00,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:32:00,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:32:00,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:32:00,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:32:00,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:32:00,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:32:00,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:32:00,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:32:00,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:32:00,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:32:00,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:32:00,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:32:00,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:32:00,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:32:00,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:32:00,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:32:00,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:32:00,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:32:00,158 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:32:00,195 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:32:00,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:32:00,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:32:00,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:32:00,200 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:32:00,200 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:32:00,202 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:32:00,203 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:32:00,203 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:32:00,203 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:32:00,204 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:32:00,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:32:00,205 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:32:00,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:32:00,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:32:00,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:32:00,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:32:00,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:32:00,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:32:00,207 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:32:00,207 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:32:00,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:32:00,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:32:00,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:32:00,209 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:32:00,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:32:00,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:32:00,209 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:32:00,210 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:32:00,211 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:32:00,212 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd4754e908bed6ae29d10e34d903201d1cfa0296 [2020-07-29 01:32:00,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:32:00,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:32:00,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:32:00,555 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:32:00,556 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:32:00,557 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strlcpy.i [2020-07-29 01:32:00,618 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cbfe2b49/ccfdd00d25db403db24cda27d22030aa/FLAG540851146 [2020-07-29 01:32:01,079 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:32:01,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strlcpy.i [2020-07-29 01:32:01,091 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cbfe2b49/ccfdd00d25db403db24cda27d22030aa/FLAG540851146 [2020-07-29 01:32:01,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cbfe2b49/ccfdd00d25db403db24cda27d22030aa [2020-07-29 01:32:01,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:32:01,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:32:01,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:32:01,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:32:01,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:32:01,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:32:01" (1/1) ... [2020-07-29 01:32:01,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d44add4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:01, skipping insertion in model container [2020-07-29 01:32:01,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:32:01" (1/1) ... [2020-07-29 01:32:01,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:32:01,514 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:32:01,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:32:01,916 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:32:01,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:32:02,022 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:32:02,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:02 WrapperNode [2020-07-29 01:32:02,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:32:02,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:32:02,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:32:02,025 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:32:02,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:02" (1/1) ... [2020-07-29 01:32:02,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:02" (1/1) ... [2020-07-29 01:32:02,106 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:32:02,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:32:02,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:32:02,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:32:02,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:02" (1/1) ... [2020-07-29 01:32:02,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:02" (1/1) ... [2020-07-29 01:32:02,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:02" (1/1) ... [2020-07-29 01:32:02,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:02" (1/1) ... [2020-07-29 01:32:02,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:02" (1/1) ... [2020-07-29 01:32:02,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:02" (1/1) ... [2020-07-29 01:32:02,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:02" (1/1) ... [2020-07-29 01:32:02,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:32:02,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:32:02,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:32:02,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:32:02,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:32:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:32:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:32:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:32:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:32:02,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:32:02,609 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:32:02,610 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:32:02,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:32:02 BoogieIcfgContainer [2020-07-29 01:32:02,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:32:02,619 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:32:02,619 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:32:02,622 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:32:02,626 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:32:02,627 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:32:01" (1/3) ... [2020-07-29 01:32:02,628 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71cd1bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:32:02, skipping insertion in model container [2020-07-29 01:32:02,628 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:32:02,628 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:02" (2/3) ... [2020-07-29 01:32:02,628 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71cd1bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:32:02, skipping insertion in model container [2020-07-29 01:32:02,629 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:32:02,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:32:02" (3/3) ... [2020-07-29 01:32:02,633 INFO L371 chiAutomizerObserver]: Analyzing ICFG strlcpy.i [2020-07-29 01:32:02,691 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:32:02,691 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:32:02,691 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:32:02,692 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:32:02,692 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:32:02,692 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:32:02,693 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:32:02,693 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:32:02,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-29 01:32:02,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:32:02,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:02,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:02,738 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:32:02,739 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:32:02,739 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:32:02,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-29 01:32:02,743 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:32:02,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:02,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:02,744 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:32:02,744 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:32:02,750 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 14#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 19#L530true assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 9#L534true assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 6#L514true assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 11#L514-2true assume strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 12#L515-4true [2020-07-29 01:32:02,751 INFO L796 eck$LassoCheckResult]: Loop: 12#L515-4true strlcpy_#t~post5.base, strlcpy_#t~post5.offset := strlcpy_~d~0.base, strlcpy_~d~0.offset;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_#t~post5.base, 1 + strlcpy_#t~post5.offset;strlcpy_#t~post6.base, strlcpy_#t~post6.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post6.base, 1 + strlcpy_#t~post6.offset;call strlcpy_#t~mem7 := read~int(strlcpy_#t~post6.base, strlcpy_#t~post6.offset, 1);call write~int(strlcpy_#t~mem7, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, 1); 3#L516true assume !(0 == strlcpy_#t~mem7);havoc strlcpy_#t~post6.base, strlcpy_#t~post6.offset;havoc strlcpy_#t~post5.base, strlcpy_#t~post5.offset;havoc strlcpy_#t~mem7; 7#L515-1true strlcpy_#t~pre4 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1; 8#L515-2true assume !!(0 != strlcpy_#t~pre4 % 4294967296);havoc strlcpy_#t~pre4; 12#L515-4true [2020-07-29 01:32:02,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:02,759 INFO L82 PathProgramCache]: Analyzing trace with hash 889571278, now seen corresponding path program 1 times [2020-07-29 01:32:02,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:02,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483665795] [2020-07-29 01:32:02,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:02,908 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:02,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:02,973 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:02,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:02,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1698155, now seen corresponding path program 1 times [2020-07-29 01:32:02,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:02,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659351603] [2020-07-29 01:32:02,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:03,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:03,030 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:03,039 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:03,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:03,044 INFO L82 PathProgramCache]: Analyzing trace with hash 707592888, now seen corresponding path program 1 times [2020-07-29 01:32:03,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:03,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385494307] [2020-07-29 01:32:03,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:03,121 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:03,155 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:03,164 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:04,039 WARN L193 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-07-29 01:32:04,262 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-07-29 01:32:04,277 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:32:04,278 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:32:04,278 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:32:04,278 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:32:04,278 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:32:04,278 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:04,279 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:32:04,279 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:32:04,279 INFO L133 ssoRankerPreferences]: Filename of dumped script: strlcpy.i_Iteration1_Lasso [2020-07-29 01:32:04,279 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:32:04,280 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:32:04,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:04,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:04,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:04,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:04,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:04,879 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2020-07-29 01:32:05,110 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2020-07-29 01:32:05,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:05,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:05,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:05,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:05,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:05,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:05,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:05,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:05,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:05,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:05,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:05,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:05,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:05,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:06,058 WARN L193 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2020-07-29 01:32:06,247 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2020-07-29 01:32:06,644 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-29 01:32:06,968 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:32:06,973 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:06,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:06,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:06,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:06,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:06,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:06,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:06,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:06,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:06,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:07,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:07,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:07,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:07,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:07,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:07,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:07,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:07,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:07,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:07,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:07,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:07,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:07,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:07,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:07,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:07,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:07,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:07,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:07,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:07,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:07,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:07,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:07,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:07,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:07,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:07,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:07,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:07,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:07,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:07,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:07,153 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:32:07,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:07,155 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:32:07,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:07,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:07,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:07,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:07,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:07,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:07,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:07,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:07,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:07,255 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:32:07,301 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:32:07,301 INFO L444 ModelExtractionUtils]: 55 out of 61 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:07,331 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:07,335 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:32:07,336 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:32:07,337 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcpy_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1) = -1*ULTIMATE.start_strlcpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 Supporting invariants [] [2020-07-29 01:32:07,589 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2020-07-29 01:32:07,598 INFO L393 LassoCheck]: Loop: "strlcpy_#t~post5.base, strlcpy_#t~post5.offset := strlcpy_~d~0.base, strlcpy_~d~0.offset;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_#t~post5.base, 1 + strlcpy_#t~post5.offset;strlcpy_#t~post6.base, strlcpy_#t~post6.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post6.base, 1 + strlcpy_#t~post6.offset;call strlcpy_#t~mem7 := read~int(strlcpy_#t~post6.base, strlcpy_#t~post6.offset, 1);call write~int(strlcpy_#t~mem7, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, 1);" "assume !(0 == strlcpy_#t~mem7);havoc strlcpy_#t~post6.base, strlcpy_#t~post6.offset;havoc strlcpy_#t~post5.base, strlcpy_#t~post5.offset;havoc strlcpy_#t~mem7;" "strlcpy_#t~pre4 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;" "assume !!(0 != strlcpy_#t~pre4 % 4294967296);havoc strlcpy_#t~pre4;" [2020-07-29 01:32:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:07,621 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:32:07,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:07,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:32:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:07,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:07,766 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {29#unseeded} is VALID [2020-07-29 01:32:07,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; {29#unseeded} is VALID [2020-07-29 01:32:07,769 INFO L280 TraceCheckUtils]: 2: Hoare triple {29#unseeded} assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; {123#(and unseeded (= |ULTIMATE.start_main_#t~malloc11.base| ULTIMATE.start_main_~in~0.base))} is VALID [2020-07-29 01:32:07,771 INFO L280 TraceCheckUtils]: 3: Hoare triple {123#(and unseeded (= |ULTIMATE.start_main_#t~malloc11.base| ULTIMATE.start_main_~in~0.base))} assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; {108#(and (= ULTIMATE.start_strlcpy_~d~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} is VALID [2020-07-29 01:32:07,773 INFO L280 TraceCheckUtils]: 4: Hoare triple {108#(and (= ULTIMATE.start_strlcpy_~d~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; {108#(and (= ULTIMATE.start_strlcpy_~d~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} is VALID [2020-07-29 01:32:07,774 INFO L280 TraceCheckUtils]: 5: Hoare triple {108#(and (= ULTIMATE.start_strlcpy_~d~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} assume strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; {108#(and (= ULTIMATE.start_strlcpy_~d~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} is VALID [2020-07-29 01:32:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:07,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:32:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:07,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:07,945 INFO L280 TraceCheckUtils]: 0: Hoare triple {109#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_strlcpy_~d~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|))) (= ULTIMATE.start_strlcpy_~d~0.base |ULTIMATE.start_main_#t~malloc11.base|))} strlcpy_#t~post5.base, strlcpy_#t~post5.offset := strlcpy_~d~0.base, strlcpy_~d~0.offset;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_#t~post5.base, 1 + strlcpy_#t~post5.offset;strlcpy_#t~post6.base, strlcpy_#t~post6.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post6.base, 1 + strlcpy_#t~post6.offset;call strlcpy_#t~mem7 := read~int(strlcpy_#t~post6.base, strlcpy_#t~post6.offset, 1);call write~int(strlcpy_#t~mem7, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, 1); {133#(and (<= 1 oldRank0) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) 1) (+ ULTIMATE.start_strlcpy_~d~0.offset oldRank0)) (= ULTIMATE.start_strlcpy_~d~0.base |ULTIMATE.start_main_#t~malloc11.base|))} is VALID [2020-07-29 01:32:07,946 INFO L280 TraceCheckUtils]: 1: Hoare triple {133#(and (<= 1 oldRank0) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) 1) (+ ULTIMATE.start_strlcpy_~d~0.offset oldRank0)) (= ULTIMATE.start_strlcpy_~d~0.base |ULTIMATE.start_main_#t~malloc11.base|))} assume !(0 == strlcpy_#t~mem7);havoc strlcpy_#t~post6.base, strlcpy_#t~post6.offset;havoc strlcpy_#t~post5.base, strlcpy_#t~post5.offset;havoc strlcpy_#t~mem7; {133#(and (<= 1 oldRank0) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) 1) (+ ULTIMATE.start_strlcpy_~d~0.offset oldRank0)) (= ULTIMATE.start_strlcpy_~d~0.base |ULTIMATE.start_main_#t~malloc11.base|))} is VALID [2020-07-29 01:32:07,947 INFO L280 TraceCheckUtils]: 2: Hoare triple {133#(and (<= 1 oldRank0) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) 1) (+ ULTIMATE.start_strlcpy_~d~0.offset oldRank0)) (= ULTIMATE.start_strlcpy_~d~0.base |ULTIMATE.start_main_#t~malloc11.base|))} strlcpy_#t~pre4 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1; {133#(and (<= 1 oldRank0) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) 1) (+ ULTIMATE.start_strlcpy_~d~0.offset oldRank0)) (= ULTIMATE.start_strlcpy_~d~0.base |ULTIMATE.start_main_#t~malloc11.base|))} is VALID [2020-07-29 01:32:07,949 INFO L280 TraceCheckUtils]: 3: Hoare triple {133#(and (<= 1 oldRank0) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) 1) (+ ULTIMATE.start_strlcpy_~d~0.offset oldRank0)) (= ULTIMATE.start_strlcpy_~d~0.base |ULTIMATE.start_main_#t~malloc11.base|))} assume !!(0 != strlcpy_#t~pre4 % 4294967296);havoc strlcpy_#t~pre4; {111#(and (= ULTIMATE.start_strlcpy_~d~0.base |ULTIMATE.start_main_#t~malloc11.base|) (or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_strlcpy_~d~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:32:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:07,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:32:07,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:07,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:32:07,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:07,998 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 [2020-07-29 01:32:08,000 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 5 states. [2020-07-29 01:32:08,269 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 5 states. Result 49 states and 71 transitions. Complement of second has 8 states. [2020-07-29 01:32:08,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:32:08,270 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:08,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-29 01:32:08,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:32:08,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:08,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:08,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:32:08,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:32:08,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:08,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:08,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 71 transitions. [2020-07-29 01:32:08,291 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:32:08,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:08,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:08,296 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states. [2020-07-29 01:32:08,303 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:32:08,306 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:32:08,307 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:32:08,318 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:32:08,321 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:32:08,321 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 49 states and 71 transitions. cyclomatic complexity: 27 [2020-07-29 01:32:08,322 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:32:08,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:32:08,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:32:08,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:32:08,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:32:08,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:32:08,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:32:08,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:08,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:08,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:08,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 49 letters. Loop has 49 letters. [2020-07-29 01:32:08,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 49 letters. Loop has 49 letters. [2020-07-29 01:32:08,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 49 letters. Loop has 49 letters. [2020-07-29 01:32:08,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:32:08,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:32:08,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:32:08,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:08,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:08,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:08,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:08,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:08,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:08,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:08,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:08,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:08,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:32:08,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:32:08,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:32:08,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:32:08,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:32:08,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:32:08,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:32:08,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:32:08,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:32:08,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:32:08,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:32:08,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:32:08,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:32:08,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:32:08,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:32:08,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:32:08,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:32:08,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:32:08,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:08,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:08,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:08,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:08,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:08,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:08,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:32:08,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:32:08,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:32:08,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:32:08,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:32:08,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 71 transitions. cyclomatic complexity: 27 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:32:08,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,373 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:32:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2020-07-29 01:32:08,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:32:08,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:32:08,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:32:08,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:08,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 71 transitions. cyclomatic complexity: 27 [2020-07-29 01:32:08,389 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:32:08,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 22 states and 28 transitions. [2020-07-29 01:32:08,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:32:08,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 01:32:08,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2020-07-29 01:32:08,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:32:08,397 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-07-29 01:32:08,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2020-07-29 01:32:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2020-07-29 01:32:08,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:08,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 28 transitions. Second operand 17 states. [2020-07-29 01:32:08,427 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 28 transitions. Second operand 17 states. [2020-07-29 01:32:08,429 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 17 states. [2020-07-29 01:32:08,434 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:08,437 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-07-29 01:32:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2020-07-29 01:32:08,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:08,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:08,441 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 22 states and 28 transitions. [2020-07-29 01:32:08,442 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 22 states and 28 transitions. [2020-07-29 01:32:08,450 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:08,453 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-07-29 01:32:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2020-07-29 01:32:08,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:08,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:08,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:08,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:08,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:32:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2020-07-29 01:32:08,458 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-07-29 01:32:08,458 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-07-29 01:32:08,458 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:32:08,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2020-07-29 01:32:08,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:32:08,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:08,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:08,460 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:32:08,461 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:32:08,461 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 220#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 221#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 215#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 212#L514 assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 213#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 207#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 219#L521 assume !(0 != strlcpy_~siz % 4294967296); 217#L523-2 [2020-07-29 01:32:08,461 INFO L796 eck$LassoCheckResult]: Loop: 217#L523-2 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 216#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset;havoc strlcpy_#t~mem9; 217#L523-2 [2020-07-29 01:32:08,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:08,462 INFO L82 PathProgramCache]: Analyzing trace with hash 179527912, now seen corresponding path program 1 times [2020-07-29 01:32:08,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:08,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944158258] [2020-07-29 01:32:08,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:08,531 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.ProofTermGenerator.convert(ProofTermGenerator.java:150) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getProof(SMTInterpol.java:797) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkStemFeasibility(LassoCheck.java:883) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:797) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 01:32:08,536 INFO L168 Benchmark]: Toolchain (without parser) took 7088.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.6 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 123.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:08,536 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:32:08,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 573.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:08,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:08,542 INFO L168 Benchmark]: Boogie Preprocessor took 30.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:32:08,543 INFO L168 Benchmark]: RCFGBuilder took 480.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:08,544 INFO L168 Benchmark]: BuchiAutomizer took 5914.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -19.6 MB). Peak memory consumption was 103.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:08,550 INFO L336 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 573.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 480.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5914.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -19.6 MB). Peak memory consumption was 103.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...