./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca.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-15/cstrncpy_mixed_alloca.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 99fa7faeff0fbb15c403f314a2e472d357eac4283760e9e7213aeabb8b292c8a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:19,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:19,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:19,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:19,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:19,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:19,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:19,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:19,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:19,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:19,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:19,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:19,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:19,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:19,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:19,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:19,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:19,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:19,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:19,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:19,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:19,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:19,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:19,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:19,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:19,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:19,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:19,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:19,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:19,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:19,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:19,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:19,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:19,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:19,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:19,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:19,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:19,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:19,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:19,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:19,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:19,243 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:35:19,268 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:19,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:19,269 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:19,269 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:19,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:19,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:19,270 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:19,271 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:19,271 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:19,271 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:19,272 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:19,272 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:19,272 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:19,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:19,272 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:19,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:19,272 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:19,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:19,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:19,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:19,273 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:19,273 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:19,273 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:19,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:19,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:19,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:19,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:19,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:19,275 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:19,275 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 -> 99fa7faeff0fbb15c403f314a2e472d357eac4283760e9e7213aeabb8b292c8a [2022-02-21 03:35:19,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:19,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:19,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:19,522 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:19,523 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:19,524 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca.i [2022-02-21 03:35:19,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6bf92a4/186f8749a95e48e3af11f4247aa21a49/FLAGfe729eb56 [2022-02-21 03:35:19,958 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:19,958 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca.i [2022-02-21 03:35:19,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6bf92a4/186f8749a95e48e3af11f4247aa21a49/FLAGfe729eb56 [2022-02-21 03:35:19,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6bf92a4/186f8749a95e48e3af11f4247aa21a49 [2022-02-21 03:35:19,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:19,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:19,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:19,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:19,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:19,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:19" (1/1) ... [2022-02-21 03:35:19,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca64543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:19, skipping insertion in model container [2022-02-21 03:35:19,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:19" (1/1) ... [2022-02-21 03:35:20,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:20,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:20,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:20,333 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:20,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:20,419 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:20,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:20 WrapperNode [2022-02-21 03:35:20,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:20,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:20,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:20,422 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:20,427 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:35:20" (1/1) ... [2022-02-21 03:35:20,439 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:35:20" (1/1) ... [2022-02-21 03:35:20,459 INFO L137 Inliner]: procedures = 152, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2022-02-21 03:35:20,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:20,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:20,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:20,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:20,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:20" (1/1) ... [2022-02-21 03:35:20,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:20" (1/1) ... [2022-02-21 03:35:20,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:20" (1/1) ... [2022-02-21 03:35:20,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:20" (1/1) ... [2022-02-21 03:35:20,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:20" (1/1) ... [2022-02-21 03:35:20,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:20" (1/1) ... [2022-02-21 03:35:20,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:20" (1/1) ... [2022-02-21 03:35:20,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:20,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:20,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:20,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:20,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:20" (1/1) ... [2022-02-21 03:35:20,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:20,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:20,522 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:35:20,540 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:35:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:20,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:35:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:20,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:20,633 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:20,635 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:20,941 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:20,946 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:20,946 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:35:20,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:20 BoogieIcfgContainer [2022-02-21 03:35:20,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:20,949 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:20,949 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:20,963 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:20,964 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:20,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:19" (1/3) ... [2022-02-21 03:35:20,965 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ae6a5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:20, skipping insertion in model container [2022-02-21 03:35:20,965 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:20,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:20" (2/3) ... [2022-02-21 03:35:20,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ae6a5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:20, skipping insertion in model container [2022-02-21 03:35:20,966 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:20,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:20" (3/3) ... [2022-02-21 03:35:20,967 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrncpy_mixed_alloca.i [2022-02-21 03:35:21,013 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:21,013 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:21,014 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:21,014 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:21,014 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:21,014 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:21,014 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:21,014 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:21,027 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:35:21,052 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:21,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:21,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:21,057 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:21,057 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:21,057 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:21,057 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:35:21,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:21,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:21,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:21,063 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:21,064 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:21,069 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; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet211#1, main_#t~nondet212#1, main_#t~malloc213#1.base, main_#t~malloc213#1.offset, main_#t~malloc214#1.base, main_#t~malloc214#1.offset, main_#t~ret215#1.base, main_#t~ret215#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~nondet211#1;havoc main_#t~nondet211#1;main_~n~0#1 := main_#t~nondet212#1;havoc main_#t~nondet212#1; 12#L385true assume !(main_~length~0#1 < 1); 7#L385-2true assume !(main_~n~0#1 < 1); 6#L388-1true call main_#t~malloc213#1.base, main_#t~malloc213#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc213#1.base, main_#t~malloc213#1.offset;call main_#t~malloc214#1.base, main_#t~malloc214#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc214#1.base, main_#t~malloc214#1.offset;call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + (main_~n~0#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~post205#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, cstrncpy_#t~mem208#1, cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset, cstrncpy_#t~post209#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; 15#L370-2true [2022-02-21 03:35:21,070 INFO L793 eck$LassoCheckResult]: Loop: 15#L370-2true assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post205#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post205#1 - 1;havoc cstrncpy_#t~post205#1;cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset - 1;cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post207#1.base, 1 + cstrncpy_#t~post207#1.offset;call cstrncpy_#t~mem208#1 := read~int(cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, 1);call write~int(cstrncpy_#t~mem208#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, 1); 14#L372true assume !(0 == cstrncpy_#t~mem208#1);havoc cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset;havoc cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset;havoc cstrncpy_#t~mem208#1; 15#L370-2true [2022-02-21 03:35:21,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:21,075 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 03:35:21,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:21,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437319107] [2022-02-21 03:35:21,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,226 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,267 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2022-02-21 03:35:21,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:21,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812174281] [2022-02-21 03:35:21,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,303 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,326 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:21,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2022-02-21 03:35:21,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:21,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531015298] [2022-02-21 03:35:21,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,362 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,386 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:22,105 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:22,106 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:22,106 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:22,106 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:22,106 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:22,106 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:22,107 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:22,107 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:22,107 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncpy_mixed_alloca.i_Iteration1_Lasso [2022-02-21 03:35:22,107 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:22,107 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:22,144 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:35:22,150 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:35:22,152 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:35:22,156 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:35:22,158 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:35:22,161 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:35:22,164 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:35:22,167 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:35:22,170 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:35:22,172 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:35:22,174 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:35:22,177 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:35:22,180 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:35:22,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:22,778 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:35:22,779 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:35:22,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:22,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:22,785 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:35:22,787 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:35:22,789 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:35:22,791 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:35:23,313 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:23,316 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:23,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,332 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:35:23,333 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:35:23,334 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:35:23,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,362 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:35:23,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,364 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:35:23,370 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:35:23,371 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:35:23,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,412 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:35:23,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,414 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:35:23,415 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:35:23,419 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:35:23,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,446 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:35:23,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,448 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:35:23,449 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:35:23,450 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:35:23,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,482 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:35:23,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,484 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:35:23,485 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:35:23,486 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:35:23,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:23,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,532 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:35:23,533 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:35:23,534 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:35:23,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:23,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:23,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:23,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,586 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:35:23,586 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:35:23,588 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:35:23,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,629 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:35:23,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,631 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:35:23,632 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:35:23,634 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:35:23,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,672 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:35:23,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,674 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:35:23,675 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:35:23,676 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:35:23,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,716 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:35:23,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,718 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:35:23,722 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:35:23,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,737 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:35:23,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,763 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:35:23,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,765 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:35:23,766 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:35:23,767 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:35:23,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:23,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,812 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:35:23,813 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:35:23,814 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:35:23,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:23,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:23,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,858 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:35:23,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,860 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:35:23,862 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:35:23,863 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:35:23,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:23,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:23,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,908 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:35:23,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,909 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:35:23,910 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:35:23,912 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:35:23,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:23,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:23,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,956 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:35:23,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,957 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:35:23,958 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:35:23,959 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:35:23,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:23,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:23,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:24,004 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:35:24,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:24,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:24,006 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:35:24,007 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:35:24,009 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:35:24,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:24,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:24,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:24,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:24,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:24,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:24,032 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:24,049 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:35:24,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:24,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:24,051 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:35:24,052 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:35:24,053 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:35:24,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:24,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:24,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:24,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:24,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:24,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:24,081 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:24,098 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:35:24,098 INFO L444 ModelExtractionUtils]: 6 out of 28 variables were initially zero. Simplification set additionally 19 variables to zero. [2022-02-21 03:35:24,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:24,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:24,102 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:35:24,103 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:35:24,112 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:24,134 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:24,134 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:24,134 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc214#1.base)_1, ULTIMATE.start_cstrncpy_~src~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc214#1.base)_1 - 1*ULTIMATE.start_cstrncpy_~src~0#1.offset Supporting invariants [] [2022-02-21 03:35:24,155 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:35:24,215 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2022-02-21 03:35:24,236 INFO L390 LassoCheck]: Loop: "assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post205#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post205#1 - 1;havoc cstrncpy_#t~post205#1;cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset - 1;cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post207#1.base, 1 + cstrncpy_#t~post207#1.offset;call cstrncpy_#t~mem208#1 := read~int(cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, 1);call write~int(cstrncpy_#t~mem208#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, 1);" "assume !(0 == cstrncpy_#t~mem208#1);havoc cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset;havoc cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset;havoc cstrncpy_#t~mem208#1;" [2022-02-21 03:35:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:24,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:24,332 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:35:24,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:24,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:24,356 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:35:24,357 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~nondet211#1, main_#t~nondet212#1, main_#t~malloc213#1.base, main_#t~malloc213#1.offset, main_#t~malloc214#1.base, main_#t~malloc214#1.offset, main_#t~ret215#1.base, main_#t~ret215#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~nondet211#1;havoc main_#t~nondet211#1;main_~n~0#1 := main_#t~nondet212#1;havoc main_#t~nondet212#1; {24#unseeded} is VALID [2022-02-21 03:35:24,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#unseeded} assume !(main_~length~0#1 < 1); {24#unseeded} is VALID [2022-02-21 03:35:24,358 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#unseeded} assume !(main_~n~0#1 < 1); {24#unseeded} is VALID [2022-02-21 03:35:24,359 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#unseeded} call main_#t~malloc213#1.base, main_#t~malloc213#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc213#1.base, main_#t~malloc213#1.offset;call main_#t~malloc214#1.base, main_#t~malloc214#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc214#1.base, main_#t~malloc214#1.offset;call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + (main_~n~0#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~post205#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, cstrncpy_#t~mem208#1, cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset, cstrncpy_#t~post209#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; {98#(and (= |ULTIMATE.start_main_#t~malloc214#1.base| |ULTIMATE.start_cstrncpy_~src~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:24,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:35:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:24,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:24,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#(and (= |ULTIMATE.start_main_#t~malloc214#1.base| |ULTIMATE.start_cstrncpy_~src~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc214#1.base|))))} assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post205#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post205#1 - 1;havoc cstrncpy_#t~post205#1;cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset - 1;cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post207#1.base, 1 + cstrncpy_#t~post207#1.offset;call cstrncpy_#t~mem208#1 := read~int(cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, 1);call write~int(cstrncpy_#t~mem208#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, 1); {119#(and (= |ULTIMATE.start_main_#t~malloc214#1.base| |ULTIMATE.start_cstrncpy_~src~0#1.base|) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc214#1.base|) 1) (+ |ULTIMATE.start_cstrncpy_~src~0#1.offset| oldRank0)) (<= 1 oldRank0))} is VALID [2022-02-21 03:35:24,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {119#(and (= |ULTIMATE.start_main_#t~malloc214#1.base| |ULTIMATE.start_cstrncpy_~src~0#1.base|) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc214#1.base|) 1) (+ |ULTIMATE.start_cstrncpy_~src~0#1.offset| oldRank0)) (<= 1 oldRank0))} assume !(0 == cstrncpy_#t~mem208#1);havoc cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset;havoc cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset;havoc cstrncpy_#t~mem208#1; {101#(and (= |ULTIMATE.start_main_#t~malloc214#1.base| |ULTIMATE.start_cstrncpy_~src~0#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc214#1.base|))))))} is VALID [2022-02-21 03:35:24,449 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:35:24,468 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:35:24,477 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:35:24,478 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:35:24,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,483 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:35:24,484 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:35:24,544 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 27 states and 37 transitions. Complement of second has 6 states. [2022-02-21 03:35:24,544 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:35:24,544 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:24,545 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:35:24,546 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:24,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:24,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:24,547 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:35:24,548 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:35:24,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:24,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:24,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. [2022-02-21 03:35:24,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:24,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:24,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:24,552 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:35:24,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:24,554 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:35:24,554 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:35:24,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:35:24,555 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:35:24,555 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 37 transitions. cyclomatic complexity: 13 [2022-02-21 03:35:24,556 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:35:24,556 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:35:24,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,556 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:35:24,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:24,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,557 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:35:24,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,557 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:35:24,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:35:24,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,558 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:35:24,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,558 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:35:24,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:24,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,559 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 27 letters. Loop has 27 letters. [2022-02-21 03:35:24,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,559 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 27 letters. Loop has 27 letters. [2022-02-21 03:35:24,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 13 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:35:24,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,560 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:35:24,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,560 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:35:24,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:35:24,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,561 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:35:24,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,561 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:35:24,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:24,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,562 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:35:24,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,562 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:35:24,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:24,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,563 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:35:24,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,563 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:35:24,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:24,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,564 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:35:24,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,565 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:35:24,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:24,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,565 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:35:24,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,566 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:35:24,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:35:24,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,567 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:35:24,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,567 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:35:24,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:35:24,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,568 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:35:24,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,568 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:35:24,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:35:24,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,569 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:35:24,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,569 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:35:24,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:24,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,570 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:35:24,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,570 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:35:24,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:35:24,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,571 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:24,574 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:35:24,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-21 03:35:24,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:24,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:24,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:35:24,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. cyclomatic complexity: 13 [2022-02-21 03:35:24,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:24,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 11 states and 14 transitions. [2022-02-21 03:35:24,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:35:24,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:35:24,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2022-02-21 03:35:24,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:24,582 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 03:35:24,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2022-02-21 03:35:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-02-21 03:35:24,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:24,597 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:35:24,597 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:35:24,599 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:35:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:24,601 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 03:35:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:35:24,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:24,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:24,602 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:35:24,602 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:35:24,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:24,603 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 03:35:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:35:24,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:24,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:24,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:24,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:24,603 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:35:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2022-02-21 03:35:24,604 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:35:24,605 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:35:24,605 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:24,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:35:24,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:24,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:24,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:24,605 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:24,606 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:24,606 INFO L791 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 162#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet211#1, main_#t~nondet212#1, main_#t~malloc213#1.base, main_#t~malloc213#1.offset, main_#t~malloc214#1.base, main_#t~malloc214#1.offset, main_#t~ret215#1.base, main_#t~ret215#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~nondet211#1;havoc main_#t~nondet211#1;main_~n~0#1 := main_#t~nondet212#1;havoc main_#t~nondet212#1; 166#L385 assume !(main_~length~0#1 < 1); 165#L385-2 assume !(main_~n~0#1 < 1); 163#L388-1 call main_#t~malloc213#1.base, main_#t~malloc213#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc213#1.base, main_#t~malloc213#1.offset;call main_#t~malloc214#1.base, main_#t~malloc214#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc214#1.base, main_#t~malloc214#1.offset;call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + (main_~n~0#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~post205#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, cstrncpy_#t~mem208#1, cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset, cstrncpy_#t~post209#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; 164#L370-2 assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post205#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post205#1 - 1;havoc cstrncpy_#t~post205#1;cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset - 1;cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post207#1.base, 1 + cstrncpy_#t~post207#1.offset;call cstrncpy_#t~mem208#1 := read~int(cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, 1);call write~int(cstrncpy_#t~mem208#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, 1); 167#L372 assume 0 == cstrncpy_#t~mem208#1;havoc cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset;havoc cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset;havoc cstrncpy_#t~mem208#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; 159#L375-3 [2022-02-21 03:35:24,606 INFO L793 eck$LassoCheckResult]: Loop: 159#L375-3 cstrncpy_#t~post209#1 := cstrncpy_~n2~0#1;cstrncpy_~n2~0#1 := cstrncpy_#t~post209#1 - 1; 160#L375-1 assume !!(0 != cstrncpy_#t~post209#1);havoc cstrncpy_#t~post209#1;cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset := cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset := cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset - 1;call write~int(0, cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset, 1);havoc cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset; 159#L375-3 [2022-02-21 03:35:24,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:24,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2022-02-21 03:35:24,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:24,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081982982] [2022-02-21 03:35:24,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:24,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,629 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,644 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:24,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:24,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2022-02-21 03:35:24,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:24,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732769000] [2022-02-21 03:35:24,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:24,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,649 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,652 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:24,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:24,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2022-02-21 03:35:24,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:24,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145006622] [2022-02-21 03:35:24,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:24,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,673 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,687 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:25,656 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:25,657 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:25,657 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:25,657 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:25,657 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:25,657 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,657 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:25,657 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:25,657 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncpy_mixed_alloca.i_Iteration2_Lasso [2022-02-21 03:35:25,658 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:25,658 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:25,666 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:35:25,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:35:25,671 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:35:25,672 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:35:25,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:35:25,676 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:35:25,678 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:35:25,680 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:35:25,682 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:35:25,683 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:35:25,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:35:25,687 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:35:25,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:35:25,690 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:35:25,693 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:35:25,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:35:26,207 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:35:26,209 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:35:26,210 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:35:26,691 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:26,692 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:26,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,693 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:35:26,699 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:35:26,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,723 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:35:26,732 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:35:26,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,734 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:35:26,735 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:35:26,736 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:35:26,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,758 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,785 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:35:26,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,787 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:26,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:35:26,789 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:35:26,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:26,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,851 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:26,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:35:26,853 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:35:26,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,874 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:35:26,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,891 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:26,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:35:26,932 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:35:26,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:26,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,957 INFO L229 MonitoredProcess]: Starting monitored process 25 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:35:26,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:35:26,959 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:35:26,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:26,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,994 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:26,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:35:26,996 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:35:27,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:27,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:27,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,039 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:27,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:35:27,041 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:35:27,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,072 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:27,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:35:27,074 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:35:27,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,105 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:27,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:35:27,107 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:35:27,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,135 INFO L229 MonitoredProcess]: Starting monitored process 30 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:35:27,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:35:27,138 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:35:27,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,178 INFO L229 MonitoredProcess]: Starting monitored process 31 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:35:27,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:35:27,181 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:35:27,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,211 INFO L229 MonitoredProcess]: Starting monitored process 32 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:35:27,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:35:27,213 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:35:27,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,254 INFO L229 MonitoredProcess]: Starting monitored process 33 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:35:27,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:35:27,256 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:35:27,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:27,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:27,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,284 INFO L229 MonitoredProcess]: Starting monitored process 34 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:35:27,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:35:27,287 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:35:27,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,325 INFO L229 MonitoredProcess]: Starting monitored process 35 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:35:27,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:35:27,328 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:35:27,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:27,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:27,346 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,374 INFO L229 MonitoredProcess]: Starting monitored process 36 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:35:27,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:35:27,376 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:35:27,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,417 INFO L229 MonitoredProcess]: Starting monitored process 37 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:35:27,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:35:27,420 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:35:27,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:27,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:27,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,459 INFO L229 MonitoredProcess]: Starting monitored process 38 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:35:27,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:35:27,461 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:35:27,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:27,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:27,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,516 INFO L229 MonitoredProcess]: Starting monitored process 39 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:35:27,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:35:27,518 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:35:27,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:27,528 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:27,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,569 INFO L229 MonitoredProcess]: Starting monitored process 40 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:35:27,574 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:35:27,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:35:27,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:27,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:27,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,633 INFO L229 MonitoredProcess]: Starting monitored process 41 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:35:27,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:35:27,639 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:35:27,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,689 INFO L229 MonitoredProcess]: Starting monitored process 42 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:35:27,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:35:27,692 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:35:27,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,700 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:35:27,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,731 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 03:35:27,732 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:35:27,822 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:27,889 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-02-21 03:35:27,889 INFO L444 ModelExtractionUtils]: 45 out of 66 variables were initially zero. Simplification set additionally 18 variables to zero. [2022-02-21 03:35:27,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,891 INFO L229 MonitoredProcess]: Starting monitored process 43 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:35:27,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:35:27,893 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:27,913 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-02-21 03:35:27,913 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:27,914 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n2~0#1) = 1*ULTIMATE.start_cstrncpy_~n2~0#1 Supporting invariants [1*ULTIMATE.start_cstrncpy_~n2~0#1 >= 0] [2022-02-21 03:35:27,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:28,006 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2022-02-21 03:35:28,012 INFO L390 LassoCheck]: Loop: "cstrncpy_#t~post209#1 := cstrncpy_~n2~0#1;cstrncpy_~n2~0#1 := cstrncpy_#t~post209#1 - 1;" "assume !!(0 != cstrncpy_#t~post209#1);havoc cstrncpy_#t~post209#1;cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset := cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset := cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset - 1;call write~int(0, cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset, 1);havoc cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset;" [2022-02-21 03:35:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:35:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:28,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {200#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {200#unseeded} is VALID [2022-02-21 03:35:28,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {200#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet211#1, main_#t~nondet212#1, main_#t~malloc213#1.base, main_#t~malloc213#1.offset, main_#t~malloc214#1.base, main_#t~malloc214#1.offset, main_#t~ret215#1.base, main_#t~ret215#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~nondet211#1;havoc main_#t~nondet211#1;main_~n~0#1 := main_#t~nondet212#1;havoc main_#t~nondet212#1; {200#unseeded} is VALID [2022-02-21 03:35:28,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {200#unseeded} assume !(main_~length~0#1 < 1); {200#unseeded} is VALID [2022-02-21 03:35:28,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {200#unseeded} assume !(main_~n~0#1 < 1); {200#unseeded} is VALID [2022-02-21 03:35:28,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {200#unseeded} call main_#t~malloc213#1.base, main_#t~malloc213#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc213#1.base, main_#t~malloc213#1.offset;call main_#t~malloc214#1.base, main_#t~malloc214#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc214#1.base, main_#t~malloc214#1.offset;call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + (main_~n~0#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~post205#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, cstrncpy_#t~mem208#1, cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset, cstrncpy_#t~post209#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; {200#unseeded} is VALID [2022-02-21 03:35:28,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {200#unseeded} assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post205#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post205#1 - 1;havoc cstrncpy_#t~post205#1;cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset - 1;cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post207#1.base, 1 + cstrncpy_#t~post207#1.offset;call cstrncpy_#t~mem208#1 := read~int(cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, 1);call write~int(cstrncpy_#t~mem208#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, 1); {303#(and unseeded (< 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)))} is VALID [2022-02-21 03:35:28,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {303#(and unseeded (< 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)))} assume 0 == cstrncpy_#t~mem208#1;havoc cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset;havoc cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset;havoc cstrncpy_#t~mem208#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; {279#(and (>= |ULTIMATE.start_cstrncpy_~n2~0#1| 0) unseeded)} is VALID [2022-02-21 03:35:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:28,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {280#(and (>= |ULTIMATE.start_cstrncpy_~n2~0#1| 0) (>= oldRank0 |ULTIMATE.start_cstrncpy_~n2~0#1|))} cstrncpy_#t~post209#1 := cstrncpy_~n2~0#1;cstrncpy_~n2~0#1 := cstrncpy_#t~post209#1 - 1; {307#(and (= |ULTIMATE.start_cstrncpy_~n2~0#1| (+ (- 1) |ULTIMATE.start_cstrncpy_#t~post209#1|)) (<= 0 |ULTIMATE.start_cstrncpy_#t~post209#1|) (<= |ULTIMATE.start_cstrncpy_#t~post209#1| oldRank0))} is VALID [2022-02-21 03:35:28,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#(and (= |ULTIMATE.start_cstrncpy_~n2~0#1| (+ (- 1) |ULTIMATE.start_cstrncpy_#t~post209#1|)) (<= 0 |ULTIMATE.start_cstrncpy_#t~post209#1|) (<= |ULTIMATE.start_cstrncpy_#t~post209#1| oldRank0))} assume !!(0 != cstrncpy_#t~post209#1);havoc cstrncpy_#t~post209#1;cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset := cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset := cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset - 1;call write~int(0, cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset, 1);havoc cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset; {282#(and (>= |ULTIMATE.start_cstrncpy_~n2~0#1| 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_cstrncpy_~n2~0#1|))))} is VALID [2022-02-21 03:35:28,175 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:35:28,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,185 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:35:28,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,186 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:35:28,186 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,237 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 13 states and 16 transitions. Complement of second has 5 states. [2022-02-21 03:35:28,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 0 non-accepting loop states 2 accepting loop states [2022-02-21 03:35:28,238 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:28,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:28,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:28,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:28,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,239 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:28,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:28,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2022-02-21 03:35:28,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:28,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:28,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:28,240 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:28,241 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:35:28,241 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,241 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:28,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 12 transitions. cyclomatic complexity: 10 [2022-02-21 03:35:28,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:28,242 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:35:28,242 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:28,242 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:35:28,242 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:35:28,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:28,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:35:28,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 2 letters. [2022-02-21 03:35:28,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:35:28,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:35:28,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 13 letters. Loop has 13 letters. [2022-02-21 03:35:28,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:35:28,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,245 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:35:28,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:35:28,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:28,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 4 letters. Loop has 4 letters. [2022-02-21 03:35:28,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:28,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,247 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:35:28,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:28,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,248 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:35:28,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:28,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:35:28,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 2 letters. [2022-02-21 03:35:28,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:35:28,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:35:28,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 11 letters. Loop has 2 letters. [2022-02-21 03:35:28,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:35:28,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,251 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:28,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-02-21 03:35:28,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:28,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,253 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:35:28,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:35:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:28,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {200#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {200#unseeded} is VALID [2022-02-21 03:35:28,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {200#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet211#1, main_#t~nondet212#1, main_#t~malloc213#1.base, main_#t~malloc213#1.offset, main_#t~malloc214#1.base, main_#t~malloc214#1.offset, main_#t~ret215#1.base, main_#t~ret215#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~nondet211#1;havoc main_#t~nondet211#1;main_~n~0#1 := main_#t~nondet212#1;havoc main_#t~nondet212#1; {200#unseeded} is VALID [2022-02-21 03:35:28,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {200#unseeded} assume !(main_~length~0#1 < 1); {200#unseeded} is VALID [2022-02-21 03:35:28,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {200#unseeded} assume !(main_~n~0#1 < 1); {200#unseeded} is VALID [2022-02-21 03:35:28,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {200#unseeded} call main_#t~malloc213#1.base, main_#t~malloc213#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc213#1.base, main_#t~malloc213#1.offset;call main_#t~malloc214#1.base, main_#t~malloc214#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc214#1.base, main_#t~malloc214#1.offset;call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + (main_~n~0#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~post205#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, cstrncpy_#t~mem208#1, cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset, cstrncpy_#t~post209#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; {200#unseeded} is VALID [2022-02-21 03:35:28,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {200#unseeded} assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post205#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post205#1 - 1;havoc cstrncpy_#t~post205#1;cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset - 1;cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post207#1.base, 1 + cstrncpy_#t~post207#1.offset;call cstrncpy_#t~mem208#1 := read~int(cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, 1);call write~int(cstrncpy_#t~mem208#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, 1); {356#(and unseeded (< 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)))} is VALID [2022-02-21 03:35:28,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {356#(and unseeded (< 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)))} assume 0 == cstrncpy_#t~mem208#1;havoc cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset;havoc cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset;havoc cstrncpy_#t~mem208#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; {279#(and (>= |ULTIMATE.start_cstrncpy_~n2~0#1| 0) unseeded)} is VALID [2022-02-21 03:35:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:28,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {280#(and (>= |ULTIMATE.start_cstrncpy_~n2~0#1| 0) (>= oldRank0 |ULTIMATE.start_cstrncpy_~n2~0#1|))} cstrncpy_#t~post209#1 := cstrncpy_~n2~0#1;cstrncpy_~n2~0#1 := cstrncpy_#t~post209#1 - 1; {360#(and (= |ULTIMATE.start_cstrncpy_~n2~0#1| (+ (- 1) |ULTIMATE.start_cstrncpy_#t~post209#1|)) (<= 0 |ULTIMATE.start_cstrncpy_#t~post209#1|) (<= |ULTIMATE.start_cstrncpy_#t~post209#1| oldRank0))} is VALID [2022-02-21 03:35:28,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#(and (= |ULTIMATE.start_cstrncpy_~n2~0#1| (+ (- 1) |ULTIMATE.start_cstrncpy_#t~post209#1|)) (<= 0 |ULTIMATE.start_cstrncpy_#t~post209#1|) (<= |ULTIMATE.start_cstrncpy_#t~post209#1| oldRank0))} assume !!(0 != cstrncpy_#t~post209#1);havoc cstrncpy_#t~post209#1;cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset := cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset := cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset - 1;call write~int(0, cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset, 1);havoc cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset; {282#(and (>= |ULTIMATE.start_cstrncpy_~n2~0#1| 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_cstrncpy_~n2~0#1|))))} is VALID [2022-02-21 03:35:28,373 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:35:28,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,382 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:35:28,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,383 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:35:28,383 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,427 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 5 states. [2022-02-21 03:35:28,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:28,428 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:28,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:28,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:28,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:28,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:28,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:28,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:28,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:35:28,430 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:28,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:28,430 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:28,430 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:35:28,430 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:28,431 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:28,431 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2022-02-21 03:35:28,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2022-02-21 03:35:28,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:28,432 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:35:28,432 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:35:28,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,432 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:35:28,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:28,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 2 letters. Loop has 2 letters. [2022-02-21 03:35:28,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:28,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,433 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:35:28,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,434 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:35:28,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,434 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:35:28,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,435 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:35:28,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:28,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 4 letters. Loop has 4 letters. [2022-02-21 03:35:28,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:28,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,436 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:35:28,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,437 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:35:28,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,437 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:35:28,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,438 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:35:28,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:28,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 2 letters. Loop has 2 letters. [2022-02-21 03:35:28,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:28,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,439 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:35:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-02-21 03:35:28,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:28,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:35:28,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:35:28,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2022-02-21 03:35:28,442 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:28,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2022-02-21 03:35:28,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:35:28,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:35:28,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:35:28,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:28,442 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:28,442 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:28,443 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:28,443 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:28,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:35:28,443 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:28,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:28,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:35:28 BoogieIcfgContainer [2022-02-21 03:35:28,449 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:35:28,450 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:35:28,450 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:35:28,450 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:35:28,451 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:20" (3/4) ... [2022-02-21 03:35:28,453 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:35:28,453 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:35:28,454 INFO L158 Benchmark]: Toolchain (without parser) took 8467.67ms. Allocated memory was 96.5MB in the beginning and 148.9MB in the end (delta: 52.4MB). Free memory was 66.9MB in the beginning and 61.9MB in the end (delta: 5.0MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2022-02-21 03:35:28,455 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:28,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.96ms. Allocated memory is still 96.5MB. Free memory was 66.7MB in the beginning and 61.0MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:35:28,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.81ms. Allocated memory is still 96.5MB. Free memory was 61.0MB in the beginning and 59.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:28,456 INFO L158 Benchmark]: Boogie Preprocessor took 22.37ms. Allocated memory is still 96.5MB. Free memory was 58.7MB in the beginning and 57.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:28,456 INFO L158 Benchmark]: RCFGBuilder took 465.21ms. Allocated memory was 96.5MB in the beginning and 123.7MB in the end (delta: 27.3MB). Free memory was 57.2MB in the beginning and 99.1MB in the end (delta: -41.9MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2022-02-21 03:35:28,457 INFO L158 Benchmark]: BuchiAutomizer took 7500.83ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 99.1MB in the beginning and 62.9MB in the end (delta: 36.2MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2022-02-21 03:35:28,457 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 148.9MB. Free memory was 62.9MB in the beginning and 61.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:28,458 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.96ms. Allocated memory is still 96.5MB. Free memory was 66.7MB in the beginning and 61.0MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.81ms. Allocated memory is still 96.5MB. Free memory was 61.0MB in the beginning and 59.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.37ms. Allocated memory is still 96.5MB. Free memory was 58.7MB in the beginning and 57.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 465.21ms. Allocated memory was 96.5MB in the beginning and 123.7MB in the end (delta: 27.3MB). Free memory was 57.2MB in the beginning and 99.1MB in the end (delta: -41.9MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 7500.83ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 99.1MB in the beginning and 62.9MB in the end (delta: 36.2MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 148.9MB. Free memory was 62.9MB in the beginning and 61.9MB in the end (delta: 1.0MB). 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 * src + unknown-#length-unknown[__builtin_alloca(length * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function n2 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 6.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. 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 [1, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 32 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital238 mio100 ax100 hnf100 lsp97 ukn84 mio100 lsp36 div100 bol100 ite100 ukn100 eq196 hnf89 smp100 dnf115 smp100 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 225ms VariablesStem: 12 VariablesLoop: 7 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:35:28,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:28,709 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