./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrncpy_malloc.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_malloc.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 6e588807776461813c1ae9106dc80912b11e9df5504cf2f27974dc29a72efbfe --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:18,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:18,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:18,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:18,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:18,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:18,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:18,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:18,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:18,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:18,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:18,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:18,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:18,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:18,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:18,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:18,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:18,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:18,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:18,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:18,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:18,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:18,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:18,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:18,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:18,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:18,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:18,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:18,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:18,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:18,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:18,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:18,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:18,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:18,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:18,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:18,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:18,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:18,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:18,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:18,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:18,619 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:18,643 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:18,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:18,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:18,645 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:18,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:18,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:18,646 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:18,646 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:18,647 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:18,647 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:18,648 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:18,648 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:18,648 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:18,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:18,649 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:18,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:18,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:18,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:18,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:18,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:18,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:18,650 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:18,650 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:18,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:18,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:18,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:18,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:18,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:18,654 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:18,654 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 -> 6e588807776461813c1ae9106dc80912b11e9df5504cf2f27974dc29a72efbfe [2022-02-21 03:35:18,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:18,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:18,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:18,937 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:18,937 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:18,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncpy_malloc.i [2022-02-21 03:35:18,996 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b5766af4/1c778c030e91440fa028ab9848a0bb21/FLAG3526578ef [2022-02-21 03:35:19,403 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:19,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncpy_malloc.i [2022-02-21 03:35:19,413 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b5766af4/1c778c030e91440fa028ab9848a0bb21/FLAG3526578ef [2022-02-21 03:35:19,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b5766af4/1c778c030e91440fa028ab9848a0bb21 [2022-02-21 03:35:19,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:19,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:19,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:19,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:19,433 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:19,434 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,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12cd8b25 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,436 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:19,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:19,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:19,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:19,727 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:19,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:19,779 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:19,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:19 WrapperNode [2022-02-21 03:35:19,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:19,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:19,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:19,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:19,786 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:19" (1/1) ... [2022-02-21 03:35:19,802 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:19" (1/1) ... [2022-02-21 03:35:19,829 INFO L137 Inliner]: procedures = 152, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2022-02-21 03:35:19,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:19,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:19,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:19,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:19,836 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:19" (1/1) ... [2022-02-21 03:35:19,836 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:19" (1/1) ... [2022-02-21 03:35:19,847 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:19" (1/1) ... [2022-02-21 03:35:19,848 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:19" (1/1) ... [2022-02-21 03:35:19,856 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:19" (1/1) ... [2022-02-21 03:35:19,860 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:19" (1/1) ... [2022-02-21 03:35:19,864 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:19" (1/1) ... [2022-02-21 03:35:19,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:19,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:19,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:19,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:19,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:19" (1/1) ... [2022-02-21 03:35:19,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:19,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:19,899 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:19,901 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:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:35:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:19,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:20,054 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:20,056 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:20,265 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:20,270 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:20,270 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:35:20,271 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,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:20,272 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:20,272 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:20,275 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:20,276 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:20,276 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,276 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79d6f363 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,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:20,277 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:19" (2/3) ... [2022-02-21 03:35:20,277 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79d6f363 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,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:20,277 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,278 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrncpy_malloc.i [2022-02-21 03:35:20,341 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:20,345 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:20,345 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:20,345 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:20,345 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:20,346 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:20,362 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:20,362 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:20,384 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:20,403 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:20,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:20,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:20,406 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:20,407 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:20,407 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:20,407 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:20,411 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:20,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:20,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:20,412 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:20,412 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:20,417 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; 10#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.allocOnHeap(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc213#1.base, main_#t~malloc213#1.offset;havoc main_#t~malloc213#1.base, main_#t~malloc213#1.offset;call main_#t~malloc214#1.base, main_#t~malloc214#1.offset := #Ultimate.allocOnHeap(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc214#1.base, main_#t~malloc214#1.offset;havoc 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);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:20,419 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, 1 + cstrncpy_#t~post206#1.offset;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:20,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:20,423 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 03:35:20,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:20,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426340677] [2022-02-21 03:35:20,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:20,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:20,535 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:20,582 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:20,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:20,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2022-02-21 03:35:20,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:20,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593971529] [2022-02-21 03:35:20,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:20,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:20,599 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:20,611 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:20,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:20,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2022-02-21 03:35:20,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:20,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690431801] [2022-02-21 03:35:20,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:20,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:20,662 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:20,693 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:21,326 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:21,327 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:21,327 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:21,327 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:21,327 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:21,328 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:21,328 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:21,328 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:21,328 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncpy_malloc.i_Iteration1_Lasso [2022-02-21 03:35:21,328 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:21,328 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:21,354 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:21,373 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:21,385 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,000 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,003 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,005 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,007 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,011 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,013 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,015 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,017 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,020 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,023 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,025 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,027 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,029 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,032 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,034 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,036 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,038 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,040 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,042 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,044 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,046 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,049 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,051 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,757 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:22,760 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:22,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:22,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:22,788 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:22,807 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:22,808 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:22,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:22,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:22,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:22,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:22,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:22,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:22,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:22,840 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:22,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:35:22,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:22,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:22,873 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:22,874 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:22,876 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:22,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:22,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:22,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:22,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:22,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:22,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:22,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:22,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:22,912 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:22,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:22,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:22,914 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:22,915 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:22,916 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:22,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:22,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:22,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:22,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:22,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:22,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:22,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:22,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:35:22,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:22,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:22,976 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:22,977 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:22,978 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:22,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:22,985 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 03:35:22,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:22,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:22,999 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 03:35:22,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:23,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:35:23,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,056 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,057 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,059 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,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:23,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:23,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,133 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,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,135 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,137 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,137 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,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:23,146 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:23,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,167 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,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,168 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,170 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,171 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,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:23,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:23,215 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:23,233 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:35:23,234 INFO L444 ModelExtractionUtils]: 20 out of 31 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-02-21 03:35:23,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,256 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,257 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,291 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:23,307 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:23,307 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:23,308 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n#1) = 1*ULTIMATE.start_cstrncpy_~n#1 Supporting invariants [] [2022-02-21 03:35:23,342 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,406 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-02-21 03:35:23,412 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, 1 + cstrncpy_#t~post206#1.offset;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:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:23,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:23,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:23,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:23,514 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:23,514 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:23,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#unseeded} assume !(main_~length~0#1 < 1); {24#unseeded} is VALID [2022-02-21 03:35:23,515 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#unseeded} assume !(main_~n~0#1 < 1); {24#unseeded} is VALID [2022-02-21 03:35:23,516 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#unseeded} call main_#t~malloc213#1.base, main_#t~malloc213#1.offset := #Ultimate.allocOnHeap(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc213#1.base, main_#t~malloc213#1.offset;havoc main_#t~malloc213#1.base, main_#t~malloc213#1.offset;call main_#t~malloc214#1.base, main_#t~malloc214#1.offset := #Ultimate.allocOnHeap(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc214#1.base, main_#t~malloc214#1.offset;havoc 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);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; {24#unseeded} is VALID [2022-02-21 03:35:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:23,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:35:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:23,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:23,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(>= oldRank0 |ULTIMATE.start_cstrncpy_~n#1|)} 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, 1 + cstrncpy_#t~post206#1.offset;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); {109#(and (<= (+ |ULTIMATE.start_cstrncpy_~n#1| 1) oldRank0) (< 0 oldRank0))} is VALID [2022-02-21 03:35:23,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#(and (<= (+ |ULTIMATE.start_cstrncpy_~n#1| 1) oldRank0) (< 0 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; {92#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_cstrncpy_~n#1|)) unseeded)} is VALID [2022-02-21 03:35:23,594 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:23,622 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:23,641 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:23,643 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:23,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,648 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:23,649 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:23,723 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 40 transitions. Complement of second has 5 states. [2022-02-21 03:35:23,723 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:23,724 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:23,724 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:23,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:23,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:23,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:23,740 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:23,742 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:35:23,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:23,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:23,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:35:23,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:23,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:23,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:23,744 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:23,745 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:23,746 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:35:23,746 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:23,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:35:23,748 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:35:23,748 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 40 transitions. cyclomatic complexity: 13 [2022-02-21 03:35:23,748 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:35:23,749 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:23,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,749 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:23,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:23,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,750 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:23,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,750 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:23,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:35:23,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,750 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:23,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,751 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:23,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:23,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:35:23,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:35:23,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:35:23,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,752 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:23,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,753 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:23,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:35:23,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,768 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:23,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,768 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:23,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:23,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,769 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:23,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,769 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:23,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:23,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,769 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:23,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,770 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:23,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:23,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,770 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:23,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,771 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:23,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:23,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,771 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:23,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,772 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:23,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:35:23,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,772 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:23,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,772 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:23,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:35:23,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,773 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:23,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,773 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:23,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:35:23,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,774 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:23,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,774 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:23,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:35:23,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,775 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:23,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,775 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:23,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:23,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,775 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:23,779 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:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-02-21 03:35:23,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:23,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:23,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:35:23,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:23,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. cyclomatic complexity: 13 [2022-02-21 03:35:23,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:23,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2022-02-21 03:35:23,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:35:23,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:35:23,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2022-02-21 03:35:23,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:23,797 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 03:35:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2022-02-21 03:35:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-02-21 03:35:23,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:23,836 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:23,836 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:23,838 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:23,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:23,840 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 03:35:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:35:23,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:23,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:23,841 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:23,841 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:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:23,842 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 03:35:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:35:23,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:23,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:23,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:23,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:23,842 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:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2022-02-21 03:35:23,843 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:35:23,843 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:35:23,843 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:23,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:35:23,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:23,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:23,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:23,844 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:23,844 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:23,844 INFO L791 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 151#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; 157#L385 assume !(main_~length~0#1 < 1); 156#L385-2 assume !(main_~n~0#1 < 1); 154#L388-1 call main_#t~malloc213#1.base, main_#t~malloc213#1.offset := #Ultimate.allocOnHeap(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc213#1.base, main_#t~malloc213#1.offset;havoc main_#t~malloc213#1.base, main_#t~malloc213#1.offset;call main_#t~malloc214#1.base, main_#t~malloc214#1.offset := #Ultimate.allocOnHeap(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc214#1.base, main_#t~malloc214#1.offset;havoc 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);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; 155#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, 1 + cstrncpy_#t~post206#1.offset;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); 158#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; 152#L375-3 [2022-02-21 03:35:23,844 INFO L793 eck$LassoCheckResult]: Loop: 152#L375-3 cstrncpy_#t~post209#1 := cstrncpy_~n2~0#1;cstrncpy_~n2~0#1 := cstrncpy_#t~post209#1 - 1; 153#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, 1 + cstrncpy_#t~post210#1.offset;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; 152#L375-3 [2022-02-21 03:35:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:23,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2022-02-21 03:35:23,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:23,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699143687] [2022-02-21 03:35:23,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:23,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,893 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,918 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:23,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:23,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2022-02-21 03:35:23,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:23,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177973339] [2022-02-21 03:35:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:23,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,936 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,939 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:23,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:23,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2022-02-21 03:35:23,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:23,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213698424] [2022-02-21 03:35:23,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:23,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,986 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,015 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:24,289 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:24,881 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:24,881 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:24,881 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:24,881 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:24,882 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:24,882 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:24,882 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:24,882 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:24,882 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncpy_malloc.i_Iteration2_Lasso [2022-02-21 03:35:24,882 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:24,882 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:24,884 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:24,897 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:24,899 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:24,901 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:24,902 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:24,904 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:24,906 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:24,908 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:24,911 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:24,912 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:24,914 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:24,927 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:24,929 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:24,931 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:24,933 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:24,937 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:24,939 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:24,941 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:24,943 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:24,945 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,448 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,450 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,452 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,259 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:26,262 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:26,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,264 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:26,265 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:26,266 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,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,287 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,305 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:26,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,306 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:26,307 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:26,309 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,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,349 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:26,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,350 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:26,356 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:26,357 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,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,393 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:26,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,394 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:26,396 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:26,397 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,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,438 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:26,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,440 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:26,440 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:26,442 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,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 03:35:26,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,482 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:26,483 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:26,532 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,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,556 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:26,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,557 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:26,558 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:26,559 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,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,574 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,590 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:26,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,592 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:26,593 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:26,594 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,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:26,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:26,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,630 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:26,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,632 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:26,634 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:26,635 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,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,668 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:26,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,670 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:26,670 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:26,674 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,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,708 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:26,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,710 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,711 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,712 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,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,737 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,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,738 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,741 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,741 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,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 03:35:26,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,770 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,771 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,772 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,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:35:26,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,798 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,798 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,800 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,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:26,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,832 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,833 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,834 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,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:26,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:26,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,871 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,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,873 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,874 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,875 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,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:35:26,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,910 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,910 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,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,939 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,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:35:26,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,973 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:26,980 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:26,981 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,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,989 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,005 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,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,006 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,008 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,010 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,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,064 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,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,066 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,067 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,068 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,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,075 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 03:35:27,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,095 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 03:35:27,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:27,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 03:35:27,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,162 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,163 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,164 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,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:27,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:27,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 03:35:27,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,220 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,223 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,223 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,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,272 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,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,274 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,276 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,278 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,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:27,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:27,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,340 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,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,342 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,343 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,344 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,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,352 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:35:27,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,375 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 03:35:27,375 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:35:27,430 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:27,542 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2022-02-21 03:35:27,542 INFO L444 ModelExtractionUtils]: 29 out of 96 variables were initially zero. Simplification set additionally 64 variables to zero. [2022-02-21 03:35:27,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,556 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,557 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,558 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:27,589 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-02-21 03:35:27,589 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:27,589 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,633 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,691 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2022-02-21 03:35:27,697 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, 1 + cstrncpy_#t~post210#1.offset;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:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:27,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:27,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:35:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:27,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:27,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {191#unseeded} is VALID [2022-02-21 03:35:27,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#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; {191#unseeded} is VALID [2022-02-21 03:35:27,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#unseeded} assume !(main_~length~0#1 < 1); {191#unseeded} is VALID [2022-02-21 03:35:27,782 INFO L290 TraceCheckUtils]: 3: Hoare triple {191#unseeded} assume !(main_~n~0#1 < 1); {191#unseeded} is VALID [2022-02-21 03:35:27,782 INFO L290 TraceCheckUtils]: 4: Hoare triple {191#unseeded} call main_#t~malloc213#1.base, main_#t~malloc213#1.offset := #Ultimate.allocOnHeap(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc213#1.base, main_#t~malloc213#1.offset;havoc main_#t~malloc213#1.base, main_#t~malloc213#1.offset;call main_#t~malloc214#1.base, main_#t~malloc214#1.offset := #Ultimate.allocOnHeap(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc214#1.base, main_#t~malloc214#1.offset;havoc 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);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; {191#unseeded} is VALID [2022-02-21 03:35:27,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#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, 1 + cstrncpy_#t~post206#1.offset;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); {299#(and unseeded (< 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)))} is VALID [2022-02-21 03:35:27,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {299#(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; {275#(and (>= |ULTIMATE.start_cstrncpy_~n2~0#1| 0) unseeded)} is VALID [2022-02-21 03:35:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:27,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:27,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:27,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {276#(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; {303#(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:27,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {303#(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, 1 + cstrncpy_#t~post210#1.offset;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; {278#(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:27,821 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:27,822 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:27,833 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:27,834 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:27,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,834 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:27,834 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:27,885 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:27,885 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:27,885 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:27,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:27,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:27,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:27,886 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:27,888 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:27,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:27,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2022-02-21 03:35:27,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:27,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:27,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:27,892 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:27,893 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:35:27,893 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:27,895 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:27,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 12 transitions. cyclomatic complexity: 10 [2022-02-21 03:35:27,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:27,895 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:35:27,895 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:27,896 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:35:27,896 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:27,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,897 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:27,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,897 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:27,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,898 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:27,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,898 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:27,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,898 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:27,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,898 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:27,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,899 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:27,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,899 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:27,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,899 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:27,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,899 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:27,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,900 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:27,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,900 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:27,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,900 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:27,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,900 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:27,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,901 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:27,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,901 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:27,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,902 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:27,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,902 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:27,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,903 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:27,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,903 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:27,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,904 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:27,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,904 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:27,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,905 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:27,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,905 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:27,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,905 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:27,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,905 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:27,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,906 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:27,907 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:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-02-21 03:35:27,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:27,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:27,908 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:35:27,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:27,986 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,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:27,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:35:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:28,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {191#unseeded} is VALID [2022-02-21 03:35:28,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#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; {191#unseeded} is VALID [2022-02-21 03:35:28,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#unseeded} assume !(main_~length~0#1 < 1); {191#unseeded} is VALID [2022-02-21 03:35:28,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {191#unseeded} assume !(main_~n~0#1 < 1); {191#unseeded} is VALID [2022-02-21 03:35:28,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {191#unseeded} call main_#t~malloc213#1.base, main_#t~malloc213#1.offset := #Ultimate.allocOnHeap(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc213#1.base, main_#t~malloc213#1.offset;havoc main_#t~malloc213#1.base, main_#t~malloc213#1.offset;call main_#t~malloc214#1.base, main_#t~malloc214#1.offset := #Ultimate.allocOnHeap(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc214#1.base, main_#t~malloc214#1.offset;havoc 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);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; {191#unseeded} is VALID [2022-02-21 03:35:28,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#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, 1 + cstrncpy_#t~post206#1.offset;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); {352#(and unseeded (< 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)))} is VALID [2022-02-21 03:35:28,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {352#(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; {275#(and (>= |ULTIMATE.start_cstrncpy_~n2~0#1| 0) unseeded)} is VALID [2022-02-21 03:35:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:28,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {276#(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; {356#(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,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {356#(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, 1 + cstrncpy_#t~post210#1.offset;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; {278#(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,078 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,079 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,088 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,089 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,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,089 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,089 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,134 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,135 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,135 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:28,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:28,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:28,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:28,135 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,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:28,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:28,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:28,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:35:28,137 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:28,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:28,137 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:28,137 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:35:28,138 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,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:28,138 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:28,138 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2022-02-21 03:35:28,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2022-02-21 03:35:28,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:28,139 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:35:28,139 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,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,139 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,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,139 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,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,140 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,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,140 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,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,140 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,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,141 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,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,141 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,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:35:28,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:35:28,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,142 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,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,142 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,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,142 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,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,142 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,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,143 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,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,143 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,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,143 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,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,144 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,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,144 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,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,144 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,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,145 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,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,145 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,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,145 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,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,146 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,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,146 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:28,146 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,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-02-21 03:35:28,147 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,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,147 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,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,148 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,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2022-02-21 03:35:28,149 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:28,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2022-02-21 03:35:28,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:35:28,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:35:28,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:35:28,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:28,149 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:28,149 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:28,149 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:28,150 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:28,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:35:28,150 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:28,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:28,156 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,156 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:35:28,157 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:35:28,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:35:28,157 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:35:28,158 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,160 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:35:28,160 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:35:28,161 INFO L158 Benchmark]: Toolchain (without parser) took 8733.45ms. Allocated memory was 88.1MB in the beginning and 201.3MB in the end (delta: 113.2MB). Free memory was 47.7MB in the beginning and 152.4MB in the end (delta: -104.7MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-02-21 03:35:28,162 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:28,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.75ms. Allocated memory was 88.1MB in the beginning and 119.5MB in the end (delta: 31.5MB). Free memory was 47.5MB in the beginning and 87.1MB in the end (delta: -39.6MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2022-02-21 03:35:28,163 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.26ms. Allocated memory is still 119.5MB. Free memory was 87.1MB in the beginning and 85.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:28,163 INFO L158 Benchmark]: Boogie Preprocessor took 40.74ms. Allocated memory is still 119.5MB. Free memory was 85.1MB in the beginning and 83.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:28,163 INFO L158 Benchmark]: RCFGBuilder took 399.56ms. Allocated memory is still 119.5MB. Free memory was 83.7MB in the beginning and 69.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 03:35:28,164 INFO L158 Benchmark]: BuchiAutomizer took 7884.27ms. Allocated memory was 119.5MB in the beginning and 201.3MB in the end (delta: 81.8MB). Free memory was 69.0MB in the beginning and 152.4MB in the end (delta: -83.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:28,164 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 201.3MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:28,165 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.17ms. Allocated memory is still 88.1MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.75ms. Allocated memory was 88.1MB in the beginning and 119.5MB in the end (delta: 31.5MB). Free memory was 47.5MB in the beginning and 87.1MB in the end (delta: -39.6MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.26ms. Allocated memory is still 119.5MB. Free memory was 87.1MB in the beginning and 85.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.74ms. Allocated memory is still 119.5MB. Free memory was 85.1MB in the beginning and 83.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 399.56ms. Allocated memory is still 119.5MB. Free memory was 83.7MB in the beginning and 69.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 7884.27ms. Allocated memory was 119.5MB in the beginning and 201.3MB in the end (delta: 81.8MB). Free memory was 69.0MB in the beginning and 152.4MB in the end (delta: -83.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 201.3MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n 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.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 6.8s. 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, 35 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 34 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital228 mio100 ax100 hnf100 lsp97 ukn84 mio100 lsp40 div100 bol100 ite100 ukn100 eq200 hnf88 smp100 dnf203 smp91 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 248ms VariablesStem: 18 VariablesLoop: 10 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,204 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