./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca-1.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca-1.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 622be1b3eef6dc4115831119df649831bce3bb8c1af72664b1e935607db97d0c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:32:23,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:32:23,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:32:23,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:32:23,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:32:23,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:32:23,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:32:23,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:32:23,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:32:23,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:32:23,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:32:23,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:32:23,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:32:23,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:32:23,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:32:23,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:32:23,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:32:23,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:32:23,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:32:23,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:32:23,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:32:23,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:32:23,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:32:23,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:32:23,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:32:23,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:32:23,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:32:23,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:32:23,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:32:23,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:32:23,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:32:23,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:32:23,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:32:23,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:32:23,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:32:23,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:32:23,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:32:23,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:32:23,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:32:23,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:32:23,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:32:23,558 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:32:23,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:32:23,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:32:23,584 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:32:23,584 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:32:23,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:32:23,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:32:23,585 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:32:23,585 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:32:23,585 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:32:23,586 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:32:23,586 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:32:23,586 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:32:23,587 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:32:23,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:32:23,587 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:32:23,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:32:23,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:32:23,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:32:23,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:32:23,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:32:23,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:32:23,588 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:32:23,588 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:32:23,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:32:23,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:32:23,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:32:23,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:32:23,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:32:23,590 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:32:23,590 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 622be1b3eef6dc4115831119df649831bce3bb8c1af72664b1e935607db97d0c [2022-02-21 03:32:23,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:32:23,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:32:23,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:32:23,777 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:32:23,777 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:32:23,778 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca-1.i [2022-02-21 03:32:23,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12a749637/21df6a53c2ab41d69a46f2b6778ecf0f/FLAGad64609a3 [2022-02-21 03:32:24,232 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:32:24,233 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca-1.i [2022-02-21 03:32:24,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12a749637/21df6a53c2ab41d69a46f2b6778ecf0f/FLAGad64609a3 [2022-02-21 03:32:24,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12a749637/21df6a53c2ab41d69a46f2b6778ecf0f [2022-02-21 03:32:24,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:32:24,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:32:24,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:24,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:32:24,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:32:24,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:24" (1/1) ... [2022-02-21 03:32:24,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d7aeb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:24, skipping insertion in model container [2022-02-21 03:32:24,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:24" (1/1) ... [2022-02-21 03:32:24,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:32:24,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:32:24,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:24,495 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:32:24,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:24,541 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:32:24,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:24 WrapperNode [2022-02-21 03:32:24,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:24,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:24,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:32:24,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:32:24,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:24" (1/1) ... [2022-02-21 03:32:24,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:24" (1/1) ... [2022-02-21 03:32:24,578 INFO L137 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2022-02-21 03:32:24,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:24,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:32:24,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:32:24,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:32:24,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:24" (1/1) ... [2022-02-21 03:32:24,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:24" (1/1) ... [2022-02-21 03:32:24,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:24" (1/1) ... [2022-02-21 03:32:24,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:24" (1/1) ... [2022-02-21 03:32:24,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:24" (1/1) ... [2022-02-21 03:32:24,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:24" (1/1) ... [2022-02-21 03:32:24,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:24" (1/1) ... [2022-02-21 03:32:24,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:32:24,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:32:24,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:32:24,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:32:24,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:24" (1/1) ... [2022-02-21 03:32:24,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:24,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:24,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:24,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:32:24,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:32:24,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:32:24,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:32:24,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:32:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:32:24,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:32:24,778 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:32:24,779 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:32:24,949 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:32:24,969 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:32:24,969 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:32:24,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:24 BoogieIcfgContainer [2022-02-21 03:32:24,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:32:24,971 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:32:24,971 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:32:24,974 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:32:24,974 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:24,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:32:24" (1/3) ... [2022-02-21 03:32:24,976 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e6586de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:24, skipping insertion in model container [2022-02-21 03:32:24,976 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:24,976 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:24" (2/3) ... [2022-02-21 03:32:24,976 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e6586de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:24, skipping insertion in model container [2022-02-21 03:32:24,976 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:24,976 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:24" (3/3) ... [2022-02-21 03:32:24,977 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrncpy-alloca-1.i [2022-02-21 03:32:25,020 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:32:25,020 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:32:25,021 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:32:25,021 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:32:25,021 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:32:25,021 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:32:25,021 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:32:25,022 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:32:25,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:25,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:32:25,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:25,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:25,069 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:32:25,069 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:32:25,069 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:32:25,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:25,075 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:32:25,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:25,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:25,076 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:32:25,076 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:32:25,081 INFO L791 eck$LassoCheckResult]: Stem: 4#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~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 15#L568true assume !(main_~length~0#1 < 1); 14#L568-2true assume !(main_~n~0#1 < 1); 10#L571-1true call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset, cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset, cstrncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstrncpy_#res#1.base, cstrncpy_#res#1.offset;havoc cstrncpy_#t~post2#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, cstrncpy_#t~mem5#1, cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset, cstrncpy_#t~post6#1, cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset, cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset, cstrncpy_~n#1, cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset, cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset, cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset, cstrncpy_~n2~0#1;cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset := cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset;cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset := cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset;cstrncpy_~n#1 := cstrncpy_#in~n#1;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset;havoc cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;havoc cstrncpy_~n2~0#1; 7#L553-2true [2022-02-21 03:32:25,082 INFO L793 eck$LassoCheckResult]: Loop: 7#L553-2true assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post2#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post2#1 - 1;havoc cstrncpy_#t~post2#1;cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post3#1.base, 1 + cstrncpy_#t~post3#1.offset;cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post4#1.base, 1 + cstrncpy_#t~post4#1.offset;call cstrncpy_#t~mem5#1 := read~int(cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, 1);call write~int(cstrncpy_#t~mem5#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, 1); 11#L555true assume !(0 == cstrncpy_#t~mem5#1);havoc cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset;havoc cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset;havoc cstrncpy_#t~mem5#1; 7#L553-2true [2022-02-21 03:32:25,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 03:32:25,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:25,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279877980] [2022-02-21 03:32:25,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:25,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:25,211 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:25,262 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:25,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:25,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2022-02-21 03:32:25,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:25,267 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844285518] [2022-02-21 03:32:25,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:25,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:25,302 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:25,317 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:25,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:25,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2022-02-21 03:32:25,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:25,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228784731] [2022-02-21 03:32:25,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:25,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:25,369 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:25,391 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:26,082 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:26,082 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:26,082 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:26,083 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:26,083 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:26,083 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:26,083 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:26,083 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:26,083 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca-1.i_Iteration1_Lasso [2022-02-21 03:32:26,083 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:26,083 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:26,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,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 03:32:26,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:26,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:27,262 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:27,265 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:27,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:27,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:27,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:27,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:27,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:27,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:27,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:27,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:27,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:27,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:27,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:27,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:32:27,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:27,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:27,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:27,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:27,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:27,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:32:27,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:27,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:27,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:27,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:27,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:27,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:27,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:27,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:27,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:27,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:27,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:27,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:27,366 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:27,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:32:27,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:27,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:27,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:27,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:27,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:27,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:27,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:27,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:27,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:27,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:27,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:27,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:27,406 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:27,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:32:27,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:27,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:27,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:27,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:27,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:27,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:27,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:27,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:27,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:27,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:27,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:27,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:27,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:27,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:32:27,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:27,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:27,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:27,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:27,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:27,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:27,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:27,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:27,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 03:32:27,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:27,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:27,475 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:27,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:32:27,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:27,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:27,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:27,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:27,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:27,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:27,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:27,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:27,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:27,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:32:27,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:27,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:27,503 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:27,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:32:27,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:27,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:27,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:27,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:27,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:27,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:27,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:27,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:27,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:27,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:27,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:27,555 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:27,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:32:27,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:27,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:27,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:27,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:27,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:27,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:27,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:27,588 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:27,627 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-02-21 03:32:27,628 INFO L444 ModelExtractionUtils]: 26 out of 34 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-02-21 03:32:27,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:27,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:27,630 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:27,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:32:27,633 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:27,672 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:27,672 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:27,673 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncpy_~dst~0#1.base)_1, ULTIMATE.start_cstrncpy_~dst~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncpy_~dst~0#1.base)_1 - 1*ULTIMATE.start_cstrncpy_~dst~0#1.offset Supporting invariants [] [2022-02-21 03:32:27,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:27,756 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2022-02-21 03:32:27,760 INFO L390 LassoCheck]: Loop: "assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post2#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post2#1 - 1;havoc cstrncpy_#t~post2#1;cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post3#1.base, 1 + cstrncpy_#t~post3#1.offset;cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post4#1.base, 1 + cstrncpy_#t~post4#1.offset;call cstrncpy_#t~mem5#1 := read~int(cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, 1);call write~int(cstrncpy_#t~mem5#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, 1);" "assume !(0 == cstrncpy_#t~mem5#1);havoc cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset;havoc cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset;havoc cstrncpy_#t~mem5#1;" [2022-02-21 03:32:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:27,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:27,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:27,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:27,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {24#unseeded} is VALID [2022-02-21 03:32:27,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {24#unseeded} is VALID [2022-02-21 03:32:27,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#unseeded} assume !(main_~length~0#1 < 1); {24#unseeded} is VALID [2022-02-21 03:32:27,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#unseeded} assume !(main_~n~0#1 < 1); {24#unseeded} is VALID [2022-02-21 03:32:27,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#unseeded} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset, cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset, cstrncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstrncpy_#res#1.base, cstrncpy_#res#1.offset;havoc cstrncpy_#t~post2#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, cstrncpy_#t~mem5#1, cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset, cstrncpy_#t~post6#1, cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset, cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset, cstrncpy_~n#1, cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset, cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset, cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset, cstrncpy_~n2~0#1;cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset := cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset;cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset := cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset;cstrncpy_~n#1 := cstrncpy_#in~n#1;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset;havoc cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;havoc cstrncpy_~n2~0#1; {24#unseeded} is VALID [2022-02-21 03:32:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:27,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:32:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:27,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:27,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (select |#length| |ULTIMATE.start_cstrncpy_~dst~0#1.base|)))} assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post2#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post2#1 - 1;havoc cstrncpy_#t~post2#1;cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post3#1.base, 1 + cstrncpy_#t~post3#1.offset;cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post4#1.base, 1 + cstrncpy_#t~post4#1.offset;call cstrncpy_#t~mem5#1 := read~int(cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, 1);call write~int(cstrncpy_#t~mem5#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, 1); {119#(and (<= (+ (select |#length| |ULTIMATE.start_cstrncpy_~dst~0#1.base|) 1) (+ |ULTIMATE.start_cstrncpy_~dst~0#1.offset| oldRank0)) (<= 1 oldRank0))} is VALID [2022-02-21 03:32:27,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {119#(and (<= (+ (select |#length| |ULTIMATE.start_cstrncpy_~dst~0#1.base|) 1) (+ |ULTIMATE.start_cstrncpy_~dst~0#1.offset| oldRank0)) (<= 1 oldRank0))} assume !(0 == cstrncpy_#t~mem5#1);havoc cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset;havoc cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset;havoc cstrncpy_#t~mem5#1; {102#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (select |#length| |ULTIMATE.start_cstrncpy_~dst~0#1.base|)))))} is VALID [2022-02-21 03:32:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:27,944 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 03:32:27,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:27,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:27,981 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 03:32:27,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:27,990 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:32:27,992 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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 03:32:28,040 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 30 states and 40 transitions. Complement of second has 5 states. [2022-02-21 03:32:28,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:28,041 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:28,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:28,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:32:28,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:28,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:28,043 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 03:32:28,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:32:28,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:28,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:28,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:32:28,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:28,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:28,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:28,048 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:28,049 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:32:28,050 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:28,050 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 03:32:28,051 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:32:28,051 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:28,051 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 40 transitions. cyclomatic complexity: 13 [2022-02-21 03:32:28,052 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:28,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:32:28,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,052 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 03:32:28,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:32:28,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:28,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,053 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 1 letters. [2022-02-21 03:32:28,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:28,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:28,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,054 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 2 letters. [2022-02-21 03:32:28,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:28,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:32:28,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,055 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 30 letters. Loop has 30 letters. [2022-02-21 03:32:28,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:32:28,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:32:28,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,056 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 14 letters. Loop has 14 letters. [2022-02-21 03:32:28,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:32:28,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:28,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,057 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 4 letters. Loop has 4 letters. [2022-02-21 03:32:28,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:28,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:28,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,058 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 2 letters. [2022-02-21 03:32:28,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:28,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:28,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,059 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 7 letters. Loop has 2 letters. [2022-02-21 03:32:28,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:28,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:32:28,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,060 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 03:32:28,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:32:28,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:28,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,061 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 03:32:28,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:32:28,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:28,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,062 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 03:32:28,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:28,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:28,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,063 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 1 letters. [2022-02-21 03:32:28,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:28,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:28,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,064 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 2 letters. [2022-02-21 03:32:28,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:28,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:28,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,065 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 2 letters. [2022-02-21 03:32:28,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:28,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,065 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:28,069 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 03:32:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-02-21 03:32:28,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:32:28,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:28,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:28,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:28,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. cyclomatic complexity: 13 [2022-02-21 03:32:28,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:28,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2022-02-21 03:32:28,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:32:28,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:32:28,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2022-02-21 03:32:28,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:28,077 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 03:32:28,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2022-02-21 03:32:28,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-02-21 03:32:28,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:28,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:28,094 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:28,095 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:28,097 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 03:32:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:32:28,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:28,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:28,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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 11 states and 14 transitions. [2022-02-21 03:32:28,098 INFO L87 Difference]: Start difference. First operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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 11 states and 14 transitions. [2022-02-21 03:32:28,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:28,099 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 03:32:28,099 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:32:28,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:28,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:28,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:28,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2022-02-21 03:32:28,100 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:32:28,100 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:32:28,100 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:32:28,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:32:28,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:28,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:28,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:28,101 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:28,101 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:32:28,101 INFO L791 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 164#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 167#L568 assume !(main_~length~0#1 < 1); 168#L568-2 assume !(main_~n~0#1 < 1); 169#L571-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset, cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset, cstrncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstrncpy_#res#1.base, cstrncpy_#res#1.offset;havoc cstrncpy_#t~post2#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, cstrncpy_#t~mem5#1, cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset, cstrncpy_#t~post6#1, cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset, cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset, cstrncpy_~n#1, cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset, cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset, cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset, cstrncpy_~n2~0#1;cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset := cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset;cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset := cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset;cstrncpy_~n#1 := cstrncpy_#in~n#1;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset;havoc cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;havoc cstrncpy_~n2~0#1; 166#L553-2 assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post2#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post2#1 - 1;havoc cstrncpy_#t~post2#1;cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post3#1.base, 1 + cstrncpy_#t~post3#1.offset;cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post4#1.base, 1 + cstrncpy_#t~post4#1.offset;call cstrncpy_#t~mem5#1 := read~int(cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, 1);call write~int(cstrncpy_#t~mem5#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, 1); 160#L555 assume 0 == cstrncpy_#t~mem5#1;havoc cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset;havoc cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset;havoc cstrncpy_#t~mem5#1;cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~n2~0#1 := cstrncpy_~n#1; 162#L558-3 [2022-02-21 03:32:28,102 INFO L793 eck$LassoCheckResult]: Loop: 162#L558-3 cstrncpy_#t~post6#1 := cstrncpy_~n2~0#1;cstrncpy_~n2~0#1 := cstrncpy_#t~post6#1 - 1; 165#L558-1 assume !!(0 != cstrncpy_#t~post6#1);havoc cstrncpy_#t~post6#1;cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset := cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset := cstrncpy_#t~post7#1.base, 1 + cstrncpy_#t~post7#1.offset;call write~int(0, cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset, 1);havoc cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset; 162#L558-3 [2022-02-21 03:32:28,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:28,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2022-02-21 03:32:28,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:28,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466547903] [2022-02-21 03:32:28,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:28,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:28,129 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:28,148 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:28,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:28,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2022-02-21 03:32:28,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:28,149 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236704246] [2022-02-21 03:32:28,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:28,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:28,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:28,163 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2022-02-21 03:32:28,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:28,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040045399] [2022-02-21 03:32:28,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:28,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:28,198 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:28,228 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:29,051 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:29,051 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:29,051 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:29,051 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:29,051 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:29,051 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:29,051 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:29,051 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:29,051 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca-1.i_Iteration2_Lasso [2022-02-21 03:32:29,051 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:29,051 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:29,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:29,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:30,313 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:30,314 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:30,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:30,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:30,315 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:30,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:32:30,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:30,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:30,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:30,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:30,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:30,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:30,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:30,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:30,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:30,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:30,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:30,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:30,344 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:30,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:32:30,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:30,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:30,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:30,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:30,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:30,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:30,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:30,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:30,354 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:30,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 03:32:30,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:30,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:30,372 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:30,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:32:30,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:30,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:30,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:30,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:30,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:30,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:30,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:30,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:30,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:30,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:30,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:30,404 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:30,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:32:30,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:30,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:30,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:30,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:30,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:30,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:30,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:30,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:30,414 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:30,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:30,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:30,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:30,432 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:30,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:32:30,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:30,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:30,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:30,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:30,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:30,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:30,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:30,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:30,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:30,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:30,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:30,477 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:30,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:32:30,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:30,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:30,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:30,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:30,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:30,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:30,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:30,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:30,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:30,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:30,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:30,519 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:30,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:32:30,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:30,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:30,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:30,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:30,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:30,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:30,528 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:30,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:30,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:30,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:30,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:30,556 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:30,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:32:30,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:30,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:30,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:30,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:30,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:30,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:30,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:30,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:30,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:30,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:30,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:30,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:30,598 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:30,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:32:30,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:30,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:30,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:30,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:30,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:30,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:30,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:30,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:30,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:30,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:30,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:30,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:30,627 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:30,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:32:30,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:30,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:30,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:30,638 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:32:30,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:30,673 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 03:32:30,673 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:32:30,726 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:30,862 INFO L443 ModelExtractionUtils]: Simplification made 38 calls to the SMT solver. [2022-02-21 03:32:30,862 INFO L444 ModelExtractionUtils]: 67 out of 116 variables were initially zero. Simplification set additionally 46 variables to zero. [2022-02-21 03:32:30,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:30,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:30,864 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:30,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:32:30,919 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:30,927 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2022-02-21 03:32:30,927 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:30,927 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncpy_~dst~0#1.base)_2, ULTIMATE.start_cstrncpy_~us~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncpy_~dst~0#1.base)_2 - 1*ULTIMATE.start_cstrncpy_~us~0#1.offset Supporting invariants [] [2022-02-21 03:32:30,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:31,009 INFO L297 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2022-02-21 03:32:31,014 INFO L390 LassoCheck]: Loop: "cstrncpy_#t~post6#1 := cstrncpy_~n2~0#1;cstrncpy_~n2~0#1 := cstrncpy_#t~post6#1 - 1;" "assume !!(0 != cstrncpy_#t~post6#1);havoc cstrncpy_#t~post6#1;cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset := cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset := cstrncpy_#t~post7#1.base, 1 + cstrncpy_#t~post7#1.offset;call write~int(0, cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset, 1);havoc cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset;" [2022-02-21 03:32:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:31,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:31,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:32:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:31,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:31,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {201#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {201#unseeded} is VALID [2022-02-21 03:32:31,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {201#unseeded} is VALID [2022-02-21 03:32:31,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {201#unseeded} assume !(main_~length~0#1 < 1); {201#unseeded} is VALID [2022-02-21 03:32:31,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {201#unseeded} assume !(main_~n~0#1 < 1); {201#unseeded} is VALID [2022-02-21 03:32:31,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {201#unseeded} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset, cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset, cstrncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstrncpy_#res#1.base, cstrncpy_#res#1.offset;havoc cstrncpy_#t~post2#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, cstrncpy_#t~mem5#1, cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset, cstrncpy_#t~post6#1, cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset, cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset, cstrncpy_~n#1, cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset, cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset, cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset, cstrncpy_~n2~0#1;cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset := cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset;cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset := cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset;cstrncpy_~n#1 := cstrncpy_#in~n#1;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset;havoc cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;havoc cstrncpy_~n2~0#1; {201#unseeded} is VALID [2022-02-21 03:32:31,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {201#unseeded} assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post2#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post2#1 - 1;havoc cstrncpy_#t~post2#1;cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post3#1.base, 1 + cstrncpy_#t~post3#1.offset;cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post4#1.base, 1 + cstrncpy_#t~post4#1.offset;call cstrncpy_#t~mem5#1 := read~int(cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, 1);call write~int(cstrncpy_#t~mem5#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, 1); {201#unseeded} is VALID [2022-02-21 03:32:31,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#unseeded} assume 0 == cstrncpy_#t~mem5#1;havoc cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset;havoc cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset;havoc cstrncpy_#t~mem5#1;cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~n2~0#1 := cstrncpy_~n#1; {310#(and unseeded (= |ULTIMATE.start_cstrncpy_~us~0#1.base| |ULTIMATE.start_cstrncpy_~dst~0#1.base|))} is VALID [2022-02-21 03:32:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:31,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:32:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:31,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:31,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {311#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrncpy_~dst~0#1.base|) (* (- 1) |ULTIMATE.start_cstrncpy_~us~0#1.offset|))) (= |ULTIMATE.start_cstrncpy_~us~0#1.base| |ULTIMATE.start_cstrncpy_~dst~0#1.base|))} cstrncpy_#t~post6#1 := cstrncpy_~n2~0#1;cstrncpy_~n2~0#1 := cstrncpy_#t~post6#1 - 1; {311#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrncpy_~dst~0#1.base|) (* (- 1) |ULTIMATE.start_cstrncpy_~us~0#1.offset|))) (= |ULTIMATE.start_cstrncpy_~us~0#1.base| |ULTIMATE.start_cstrncpy_~dst~0#1.base|))} is VALID [2022-02-21 03:32:31,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrncpy_~dst~0#1.base|) (* (- 1) |ULTIMATE.start_cstrncpy_~us~0#1.offset|))) (= |ULTIMATE.start_cstrncpy_~us~0#1.base| |ULTIMATE.start_cstrncpy_~dst~0#1.base|))} assume !!(0 != cstrncpy_#t~post6#1);havoc cstrncpy_#t~post6#1;cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset := cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset := cstrncpy_#t~post7#1.base, 1 + cstrncpy_#t~post7#1.offset;call write~int(0, cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset, 1);havoc cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset; {313#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_cstrncpy_~dst~0#1.base|) (* (- 1) |ULTIMATE.start_cstrncpy_~us~0#1.offset|))))) (= |ULTIMATE.start_cstrncpy_~us~0#1.base| |ULTIMATE.start_cstrncpy_~dst~0#1.base|))} is VALID [2022-02-21 03:32:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:31,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:31,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:31,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:31,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,110 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:32:31,110 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:31,137 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 16 transitions. Complement of second has 4 states. [2022-02-21 03:32:31,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:31,137 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:31,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2022-02-21 03:32:31,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:31,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:31,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:31,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:31,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:31,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:31,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:32:31,139 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:31,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:31,139 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2022-02-21 03:32:31,139 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:31,139 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:31,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:31,139 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:31,140 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2022-02-21 03:32:31,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2022-02-21 03:32:31,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:31,140 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:32:31,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:31,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:31,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:31,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:31,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:31,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:31,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:32:31,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:32:31,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:32:31,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:32:31,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:32:31,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:32:31,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:31,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:31,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:32:31,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:31,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:31,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:31,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:31,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:31,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:31,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:31,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:31,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:31,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,143 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 03:32:31,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:31,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:31,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:31,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:31,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2022-02-21 03:32:31,145 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:31,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2022-02-21 03:32:31,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:32:31,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:32:31,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:32:31,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:31,146 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:31,146 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:31,146 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:31,146 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:32:31,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:32:31,146 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:31,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:31,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:32:31 BoogieIcfgContainer [2022-02-21 03:32:31,150 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:32:31,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:32:31,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:32:31,151 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:32:31,154 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:24" (3/4) ... [2022-02-21 03:32:31,156 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:32:31,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:32:31,157 INFO L158 Benchmark]: Toolchain (without parser) took 6904.07ms. Allocated memory was 92.3MB in the beginning and 157.3MB in the end (delta: 65.0MB). Free memory was 58.5MB in the beginning and 66.4MB in the end (delta: -8.0MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:31,157 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory was 48.0MB in the beginning and 48.0MB in the end (delta: 38.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:31,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.05ms. Allocated memory is still 92.3MB. Free memory was 58.3MB in the beginning and 60.2MB in the end (delta: -1.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:32:31,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.94ms. Allocated memory is still 92.3MB. Free memory was 60.2MB in the beginning and 58.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:31,158 INFO L158 Benchmark]: Boogie Preprocessor took 41.34ms. Allocated memory is still 92.3MB. Free memory was 58.1MB in the beginning and 56.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:31,158 INFO L158 Benchmark]: RCFGBuilder took 349.20ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 56.6MB in the beginning and 106.4MB in the end (delta: -49.8MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2022-02-21 03:32:31,158 INFO L158 Benchmark]: BuchiAutomizer took 6179.28ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 106.4MB in the beginning and 66.4MB in the end (delta: 39.9MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2022-02-21 03:32:31,158 INFO L158 Benchmark]: Witness Printer took 5.27ms. Allocated memory is still 157.3MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:31,160 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.15ms. Allocated memory is still 92.3MB. Free memory was 48.0MB in the beginning and 48.0MB in the end (delta: 38.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.05ms. Allocated memory is still 92.3MB. Free memory was 58.3MB in the beginning and 60.2MB in the end (delta: -1.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.94ms. Allocated memory is still 92.3MB. Free memory was 60.2MB in the beginning and 58.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.34ms. Allocated memory is still 92.3MB. Free memory was 58.1MB in the beginning and 56.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 349.20ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 56.6MB in the beginning and 106.4MB in the end (delta: -49.8MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 6179.28ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 106.4MB in the beginning and 66.4MB in the end (delta: 39.9MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * Witness Printer took 5.27ms. Allocated memory is still 157.3MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * dst + unknown-#length-unknown[dst] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[dst] + -1 * us and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 5.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 26 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital227 mio100 ax107 hnf100 lsp90 ukn90 mio100 lsp42 div100 bol100 ite100 ukn100 eq204 hnf88 smp100 dnf115 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 301ms VariablesStem: 22 VariablesLoop: 13 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 03:32:31,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:31,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE