./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:34:59,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:34:59,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:34:59,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:34:59,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:34:59,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:34:59,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:34:59,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:34:59,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:34:59,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:34:59,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:34:59,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:34:59,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:34:59,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:34:59,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:34:59,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:34:59,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:34:59,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:34:59,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:34:59,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:34:59,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:34:59,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:34:59,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:34:59,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:34:59,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:34:59,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:34:59,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:34:59,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:34:59,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:34:59,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:34:59,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:34:59,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:34:59,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:35:00,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:35:00,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:35:00,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:35:00,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:35:00,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:35:00,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:35:00,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:35:00,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:35:00,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:35:00,028 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:35:00,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:35:00,029 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:35:00,029 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:35:00,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:35:00,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:35:00,030 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:35:00,030 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:35:00,031 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:35:00,031 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:35:00,031 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:35:00,032 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:35:00,032 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:35:00,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:35:00,032 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:35:00,032 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:35:00,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:35:00,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:35:00,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:35:00,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:35:00,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:35:00,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:35:00,033 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:35:00,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:35:00,033 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:35:00,034 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:35:00,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:35:00,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:35:00,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:35:00,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:35:00,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:35:00,035 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:35:00,035 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 [2022-02-21 04:35:00,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:35:00,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:35:00,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:35:00,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:35:00,262 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:35:00,263 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2022-02-21 04:35:00,312 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a5a4aeeb/4c46526901eb4536b5b258fbfdec5726/FLAG2f2feee88 [2022-02-21 04:35:00,669 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:35:00,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2022-02-21 04:35:00,681 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a5a4aeeb/4c46526901eb4536b5b258fbfdec5726/FLAG2f2feee88 [2022-02-21 04:35:00,689 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a5a4aeeb/4c46526901eb4536b5b258fbfdec5726 [2022-02-21 04:35:00,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:35:00,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:35:00,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:00,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:35:00,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:35:00,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:00" (1/1) ... [2022-02-21 04:35:00,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a11790d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:00, skipping insertion in model container [2022-02-21 04:35:00,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:00" (1/1) ... [2022-02-21 04:35:00,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:35:00,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:35:00,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:00,975 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:35:01,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:01,029 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:35:01,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:01 WrapperNode [2022-02-21 04:35:01,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:01,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:01,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:35:01,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:35:01,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:01" (1/1) ... [2022-02-21 04:35:01,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:01" (1/1) ... [2022-02-21 04:35:01,084 INFO L137 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2022-02-21 04:35:01,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:01,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:35:01,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:35:01,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:35:01,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:01" (1/1) ... [2022-02-21 04:35:01,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:01" (1/1) ... [2022-02-21 04:35:01,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:01" (1/1) ... [2022-02-21 04:35:01,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:01" (1/1) ... [2022-02-21 04:35:01,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:01" (1/1) ... [2022-02-21 04:35:01,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:01" (1/1) ... [2022-02-21 04:35:01,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:01" (1/1) ... [2022-02-21 04:35:01,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:35:01,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:35:01,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:35:01,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:35:01,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:01" (1/1) ... [2022-02-21 04:35:01,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:01,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:01,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:01,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:35:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:35:01,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:35:01,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:35:01,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:35:01,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:35:01,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:35:01,298 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:35:01,312 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:01,518 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:01,523 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:01,523 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 04:35:01,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:01 BoogieIcfgContainer [2022-02-21 04:35:01,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:01,525 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:01,525 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:01,528 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:01,528 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:01,528 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:35:00" (1/3) ... [2022-02-21 04:35:01,529 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14abbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:01, skipping insertion in model container [2022-02-21 04:35:01,529 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:01,529 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:01" (2/3) ... [2022-02-21 04:35:01,529 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14abbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:01, skipping insertion in model container [2022-02-21 04:35:01,529 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:01,529 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:01" (3/3) ... [2022-02-21 04:35:01,530 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrncpy-alloca-2.i [2022-02-21 04:35:01,572 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:01,572 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:01,572 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:01,572 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:01,572 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:01,572 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:01,572 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:01,572 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:01,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:01,611 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-02-21 04:35:01,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:01,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:01,616 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:01,616 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:01,616 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:01,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:01,620 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-02-21 04:35:01,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:01,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:01,621 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:01,622 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:01,627 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 7#L535true assume !(main_~length~0#1 < 1); 11#L535-2true assume !(main_~n~0#1 < 1); 16#L538-1true call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 4#L544-3true [2022-02-21 04:35:01,627 INFO L793 eck$LassoCheckResult]: Loop: 4#L544-3true assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 6#L544-2true main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 4#L544-3true [2022-02-21 04:35:01,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:01,631 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 04:35:01,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:01,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503188063] [2022-02-21 04:35:01,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:01,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,731 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,773 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:01,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:01,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-02-21 04:35:01,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:01,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298694055] [2022-02-21 04:35:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:01,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,802 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,819 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:01,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:01,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-02-21 04:35:01,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:01,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279013551] [2022-02-21 04:35:01,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:01,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,857 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:01,870 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:02,260 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:02,260 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:02,260 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:02,261 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:02,261 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:02,261 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,261 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:02,261 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:02,261 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca-2.i_Iteration1_Lasso [2022-02-21 04:35:02,261 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:02,261 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:02,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,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 04:35:02,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:02,774 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:02,777 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:02,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:02,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:35:02,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:02,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:02,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:02,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:02,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:02,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:02,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,828 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:02,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:35:02,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:02,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:02,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:02,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:02,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:02,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:02,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:02,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:02,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:35:02,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:02,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:02,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:02,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:02,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:02,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,905 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 04:35:02,906 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 04:35:02,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:02,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:02,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:02,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:02,941 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 04:35:02,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,942 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:02,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:35:02,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:02,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:02,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:02,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:02,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:02,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:02,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,979 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:02,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:35:02,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 04:35:02,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:02,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:02,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:02,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:02,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:02,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:02,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:03,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,012 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:03,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:35:03,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:03,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:03,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:03,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:03,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,056 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:03,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:35:03,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:03,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:03,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:03,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:03,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,087 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:03,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:35:03,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:03,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:03,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:03,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:03,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:03,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,140 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 04:35:03,141 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 04:35:03,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:03,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:03,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:03,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 04:35:03,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,182 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 04:35:03,183 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 04:35:03,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:03,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:03,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:03,203 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,219 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 04:35:03,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,221 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 04:35:03,221 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 04:35:03,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 04:35:03,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:03,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:03,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,284 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 04:35:03,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,286 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 04:35:03,329 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 04:35:03,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:03,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:03,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:03,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:03,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:03,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,362 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 04:35:03,363 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 04:35:03,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:03,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:03,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:03,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:03,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,419 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 04:35:03,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,420 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 04:35:03,421 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 04:35:03,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:03,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:03,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:03,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 04:35:03,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,450 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 04:35:03,451 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 04:35:03,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:03,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:03,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:03,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 04:35:03,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,485 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 04:35:03,485 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 04:35:03,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:03,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:03,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:03,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:03,517 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 04:35:03,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,518 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 04:35:03,518 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 04:35:03,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:03,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:03,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:03,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:03,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:03,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:03,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:03,546 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:03,559 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 04:35:03,560 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-02-21 04:35:03,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:03,576 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 04:35:03,623 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 04:35:03,624 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:03,656 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:03,657 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:03,657 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~length~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~length~0#1 Supporting invariants [] [2022-02-21 04:35:03,675 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 04:35:03,695 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:35:03,699 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1;" "main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" [2022-02-21 04:35:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:03,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:03,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:03,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:03,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {27#unseeded} is VALID [2022-02-21 04:35:03,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {27#unseeded} is VALID [2022-02-21 04:35:03,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#unseeded} assume !(main_~length~0#1 < 1); {27#unseeded} is VALID [2022-02-21 04:35:03,768 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#unseeded} assume !(main_~n~0#1 < 1); {27#unseeded} is VALID [2022-02-21 04:35:03,768 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#unseeded} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {27#unseeded} is VALID [2022-02-21 04:35:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:03,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:03,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:03,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; {87#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 04:35:03,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {87#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length~0#1|))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {70#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|))) unseeded)} is VALID [2022-02-21 04:35:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:03,829 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 04:35:03,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:03,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:03,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,849 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:03,850 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,916 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 58 transitions. Complement of second has 7 states. [2022-02-21 04:35:03,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:03,916 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:03,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,918 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-02-21 04:35:03,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:03,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:03,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:03,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:03,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:03,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 58 transitions. [2022-02-21 04:35:03,922 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:35:03,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:03,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:03,924 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,925 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-02-21 04:35:03,926 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 04:35:03,926 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,927 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:03,929 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:03,930 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 58 transitions. cyclomatic complexity: 26 [2022-02-21 04:35:03,930 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:35:03,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:03,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:03,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:03,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:03,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,934 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 04:35:03,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:03,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 39 letters. [2022-02-21 04:35:03,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,936 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 39 letters. Loop has 39 letters. [2022-02-21 04:35:03,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 39 letters. Loop has 39 letters. [2022-02-21 04:35:03,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:35:03,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,938 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 17 letters. Loop has 17 letters. [2022-02-21 04:35:03,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:35:03,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:03,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:03,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:03,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:03,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,940 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 04:35:03,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:03,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:03,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:03,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:03,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:03,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,944 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 04:35:03,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:03,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:03,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,946 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 04:35:03,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:03,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:03,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:03,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:03,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:03,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:03,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:03,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:03,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:03,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:03,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:03,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:03,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:03,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:03,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:03,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,956 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 04:35:03,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:03,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:03,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,957 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 04:35:03,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:03,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:03,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,958 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 04:35:03,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 58 transitions. cyclomatic complexity: 26 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:03,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,958 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-02-21 04:35:03,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:03,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:03,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:35:03,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:03,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 58 transitions. cyclomatic complexity: 26 [2022-02-21 04:35:03,975 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:35:03,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 13 states and 18 transitions. [2022-02-21 04:35:03,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 04:35:03,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 04:35:03,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2022-02-21 04:35:03,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:03,980 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 04:35:03,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2022-02-21 04:35:03,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 04:35:03,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:03,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,996 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,998 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:04,000 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2022-02-21 04:35:04,000 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2022-02-21 04:35:04,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:04,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:04,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 18 transitions. [2022-02-21 04:35:04,001 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 18 transitions. [2022-02-21 04:35:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:04,002 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2022-02-21 04:35:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2022-02-21 04:35:04,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:04,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:04,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:04,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:04,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:04,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-02-21 04:35:04,005 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 04:35:04,005 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 04:35:04,005 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:04,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-02-21 04:35:04,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:35:04,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:04,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:04,007 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:04,007 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:04,008 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 149#L535 assume !(main_~length~0#1 < 1); 150#L535-2 assume !(main_~n~0#1 < 1); 148#L538-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 140#L544-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 141#L544-4 call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset, cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset, cstrncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstrncpy_#res#1.base, cstrncpy_#res#1.offset;havoc cstrncpy_#t~post2#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, cstrncpy_#t~mem5#1, cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset, cstrncpy_#t~post6#1, cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset, cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset, cstrncpy_~n#1, cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset, cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset, cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset, cstrncpy_~n2~0#1;cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset := cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset;cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset := cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset;cstrncpy_~n#1 := cstrncpy_#in~n#1;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset;havoc cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;havoc cstrncpy_~n2~0#1; 151#L520-2 [2022-02-21 04:35:04,008 INFO L793 eck$LassoCheckResult]: Loop: 151#L520-2 assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post2#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post2#1 - 1;havoc cstrncpy_#t~post2#1;cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post3#1.base, 1 + cstrncpy_#t~post3#1.offset;cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post4#1.base, 1 + cstrncpy_#t~post4#1.offset;call cstrncpy_#t~mem5#1 := read~int(cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, 1);call write~int(cstrncpy_#t~mem5#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, 1); 152#L522 assume !(0 == cstrncpy_#t~mem5#1);havoc cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset;havoc cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset;havoc cstrncpy_#t~mem5#1; 151#L520-2 [2022-02-21 04:35:04,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:04,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-02-21 04:35:04,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:04,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764705170] [2022-02-21 04:35:04,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:04,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,056 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,074 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:04,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:04,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2195, now seen corresponding path program 1 times [2022-02-21 04:35:04,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:04,078 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891180002] [2022-02-21 04:35:04,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:04,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,088 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,100 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:04,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:04,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384832, now seen corresponding path program 1 times [2022-02-21 04:35:04,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:04,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382777532] [2022-02-21 04:35:04,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:04,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:04,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {186#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {186#true} is VALID [2022-02-21 04:35:04,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {186#true} is VALID [2022-02-21 04:35:04,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} assume !(main_~length~0#1 < 1); {188#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 04:35:04,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {188#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !(main_~n~0#1 < 1); {188#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 04:35:04,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {188#(<= 1 |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {189#(and (or (= (+ (- 1) |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0) (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0))} is VALID [2022-02-21 04:35:04,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#(and (or (= (+ (- 1) |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0) (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1 - 1); {190#(and (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1) (= |ULTIMATE.start_main_~length~0#1| 1) (not (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0)))} is VALID [2022-02-21 04:35:04,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {190#(and (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1) (= |ULTIMATE.start_main_~length~0#1| 1) (not (<= (+ |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 0)))} call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset, cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset, cstrncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstrncpy_#res#1.base, cstrncpy_#res#1.offset;havoc cstrncpy_#t~post2#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, cstrncpy_#t~mem5#1, cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset, cstrncpy_#t~post6#1, cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset, cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset, cstrncpy_~n#1, cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset, cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset, cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset, cstrncpy_~n2~0#1;cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset := cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset;cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset := cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset;cstrncpy_~n#1 := cstrncpy_#in~n#1;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset;havoc cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;havoc cstrncpy_~n2~0#1; {191#(= 0 (select (select |#memory_int| |ULTIMATE.start_cstrncpy_~src~0#1.base|) |ULTIMATE.start_cstrncpy_~src~0#1.offset|))} is VALID [2022-02-21 04:35:04,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {191#(= 0 (select (select |#memory_int| |ULTIMATE.start_cstrncpy_~src~0#1.base|) |ULTIMATE.start_cstrncpy_~src~0#1.offset|))} assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post2#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post2#1 - 1;havoc cstrncpy_#t~post2#1;cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post3#1.base, 1 + cstrncpy_#t~post3#1.offset;cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post4#1.base, 1 + cstrncpy_#t~post4#1.offset;call cstrncpy_#t~mem5#1 := read~int(cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, 1);call write~int(cstrncpy_#t~mem5#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, 1); {192#(= |ULTIMATE.start_cstrncpy_#t~mem5#1| 0)} is VALID [2022-02-21 04:35:04,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {192#(= |ULTIMATE.start_cstrncpy_#t~mem5#1| 0)} assume !(0 == cstrncpy_#t~mem5#1);havoc cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset;havoc cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset;havoc cstrncpy_#t~mem5#1; {187#false} is VALID [2022-02-21 04:35:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:04,290 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:04,290 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382777532] [2022-02-21 04:35:04,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382777532] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:04,291 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:04,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 04:35:04,291 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453341523] [2022-02-21 04:35:04,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:04,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:04,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 04:35:04,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-21 04:35:04,405 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 8 Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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 04:35:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:04,543 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-21 04:35:04,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:35:04,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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 04:35:04,552 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 04:35:04,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2022-02-21 04:35:04,553 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-02-21 04:35:04,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 24 transitions. [2022-02-21 04:35:04,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 04:35:04,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 04:35:04,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2022-02-21 04:35:04,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:04,554 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-02-21 04:35:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2022-02-21 04:35:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2022-02-21 04:35:04,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:04,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:04,555 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:04,556 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:04,556 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-21 04:35:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-21 04:35:04,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:04,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:04,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 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 19 states and 24 transitions. [2022-02-21 04:35:04,557 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 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 19 states and 24 transitions. [2022-02-21 04:35:04,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:04,557 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-21 04:35:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-21 04:35:04,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:04,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:04,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:04,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:04,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2022-02-21 04:35:04,560 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 04:35:04,560 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 04:35:04,560 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:04,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2022-02-21 04:35:04,561 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:35:04,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:04,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:04,562 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:04,562 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:04,562 INFO L791 eck$LassoCheckResult]: Stem: 223#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 224#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 226#L535 assume !(main_~length~0#1 < 1); 227#L535-2 assume !(main_~n~0#1 < 1); 225#L538-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 216#L544-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 217#L544-4 call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset, cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset, cstrncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstrncpy_#res#1.base, cstrncpy_#res#1.offset;havoc cstrncpy_#t~post2#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, cstrncpy_#t~mem5#1, cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset, cstrncpy_#t~post6#1, cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset, cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset, cstrncpy_~n#1, cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset, cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset, cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset, cstrncpy_~n2~0#1;cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset := cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset;cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset := cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset;cstrncpy_~n#1 := cstrncpy_#in~n#1;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset;havoc cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;havoc cstrncpy_~n2~0#1; 231#L520-2 assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post2#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post2#1 - 1;havoc cstrncpy_#t~post2#1;cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post3#1.base, 1 + cstrncpy_#t~post3#1.offset;cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post4#1.base, 1 + cstrncpy_#t~post4#1.offset;call cstrncpy_#t~mem5#1 := read~int(cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, 1);call write~int(cstrncpy_#t~mem5#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, 1); 230#L522 assume 0 == cstrncpy_#t~mem5#1;havoc cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset;havoc cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset;havoc cstrncpy_#t~mem5#1;cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~n2~0#1 := cstrncpy_~n#1; 222#L525-3 [2022-02-21 04:35:04,562 INFO L793 eck$LassoCheckResult]: Loop: 222#L525-3 cstrncpy_#t~post6#1 := cstrncpy_~n2~0#1;cstrncpy_~n2~0#1 := cstrncpy_#t~post6#1 - 1; 221#L525-1 assume !!(0 != cstrncpy_#t~post6#1);havoc cstrncpy_#t~post6#1;cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset := cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset := cstrncpy_#t~post7#1.base, 1 + cstrncpy_#t~post7#1.offset;call write~int(0, cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset, 1);havoc cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset; 222#L525-3 [2022-02-21 04:35:04,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:04,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384817, now seen corresponding path program 1 times [2022-02-21 04:35:04,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:04,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576455334] [2022-02-21 04:35:04,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:04,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,587 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,599 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:04,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:04,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 1 times [2022-02-21 04:35:04,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:04,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241155406] [2022-02-21 04:35:04,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:04,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,604 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,607 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:04,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:04,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2087672522, now seen corresponding path program 1 times [2022-02-21 04:35:04,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:04,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944890712] [2022-02-21 04:35:04,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:04,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,629 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:04,656 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:05,365 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:05,365 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:05,365 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:05,365 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:05,365 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:05,365 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,365 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:05,365 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:05,365 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca-2.i_Iteration3_Lasso [2022-02-21 04:35:05,365 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:05,365 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:05,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:06,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 04:35:06,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:06,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 04:35:06,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 04:35:06,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:06,717 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:06,717 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:06,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,718 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 04:35:06,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:06,727 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 04:35:06,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:06,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:06,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:06,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:06,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,746 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 04:35:06,746 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 04:35:06,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:06,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:06,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:06,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:06,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,796 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 04:35:06,797 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 04:35:06,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:06,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:06,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:06,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,844 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 04:35:06,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,845 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 04:35:06,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:06,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:06,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:06,870 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 04:35:06,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,901 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 04:35:06,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,902 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 04:35:06,905 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 04:35:06,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:06,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:06,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:06,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:06,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,938 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 04:35:06,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,940 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 04:35:06,940 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 04:35:06,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:06,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,948 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 04:35:06,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,982 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 04:35:06,982 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:35:07,045 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:07,133 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2022-02-21 04:35:07,133 INFO L444 ModelExtractionUtils]: 68 out of 111 variables were initially zero. Simplification set additionally 40 variables to zero. [2022-02-21 04:35:07,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:07,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:07,134 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 04:35:07,135 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 04:35:07,137 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:07,144 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2022-02-21 04:35:07,144 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:07,144 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10#1.base)_2) = -1*ULTIMATE.start_cstrncpy_~us~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10#1.base)_2 Supporting invariants [] [2022-02-21 04:35:07,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:07,228 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2022-02-21 04:35:07,260 INFO L390 LassoCheck]: Loop: "cstrncpy_#t~post6#1 := cstrncpy_~n2~0#1;cstrncpy_~n2~0#1 := cstrncpy_#t~post6#1 - 1;" "assume !!(0 != cstrncpy_#t~post6#1);havoc cstrncpy_#t~post6#1;cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset := cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset := cstrncpy_#t~post7#1.base, 1 + cstrncpy_#t~post7#1.offset;call write~int(0, cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset, 1);havoc cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset;" [2022-02-21 04:35:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:07,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 04:35:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:07,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:07,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {279#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {279#unseeded} is VALID [2022-02-21 04:35:07,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {279#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {279#unseeded} is VALID [2022-02-21 04:35:07,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {279#unseeded} assume !(main_~length~0#1 < 1); {279#unseeded} is VALID [2022-02-21 04:35:07,351 INFO L290 TraceCheckUtils]: 3: Hoare triple {279#unseeded} assume !(main_~n~0#1 < 1); {279#unseeded} is VALID [2022-02-21 04:35:07,351 INFO L290 TraceCheckUtils]: 4: Hoare triple {279#unseeded} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {399#(and (= |ULTIMATE.start_main_~nondetArea~0#1.base| |ULTIMATE.start_main_#t~malloc10#1.base|) unseeded)} is VALID [2022-02-21 04:35:07,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {399#(and (= |ULTIMATE.start_main_~nondetArea~0#1.base| |ULTIMATE.start_main_#t~malloc10#1.base|) unseeded)} assume !(main_~i~0#1 < main_~length~0#1 - 1); {399#(and (= |ULTIMATE.start_main_~nondetArea~0#1.base| |ULTIMATE.start_main_#t~malloc10#1.base|) unseeded)} is VALID [2022-02-21 04:35:07,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {399#(and (= |ULTIMATE.start_main_~nondetArea~0#1.base| |ULTIMATE.start_main_#t~malloc10#1.base|) unseeded)} call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset, cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset, cstrncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstrncpy_#res#1.base, cstrncpy_#res#1.offset;havoc cstrncpy_#t~post2#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, cstrncpy_#t~mem5#1, cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset, cstrncpy_#t~post6#1, cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset, cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset, cstrncpy_~n#1, cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset, cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset, cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset, cstrncpy_~n2~0#1;cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset := cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset;cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset := cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset;cstrncpy_~n#1 := cstrncpy_#in~n#1;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset;havoc cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;havoc cstrncpy_~n2~0#1; {406#(and unseeded (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_cstrncpy_~dst~0#1.base|))} is VALID [2022-02-21 04:35:07,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {406#(and unseeded (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_cstrncpy_~dst~0#1.base|))} assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post2#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post2#1 - 1;havoc cstrncpy_#t~post2#1;cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post3#1.base, 1 + cstrncpy_#t~post3#1.offset;cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post4#1.base, 1 + cstrncpy_#t~post4#1.offset;call cstrncpy_#t~mem5#1 := read~int(cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, 1);call write~int(cstrncpy_#t~mem5#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, 1); {406#(and unseeded (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_cstrncpy_~dst~0#1.base|))} is VALID [2022-02-21 04:35:07,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {406#(and unseeded (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_cstrncpy_~dst~0#1.base|))} assume 0 == cstrncpy_#t~mem5#1;havoc cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset;havoc cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset;havoc cstrncpy_#t~mem5#1;cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~n2~0#1 := cstrncpy_~n#1; {378#(and (= |ULTIMATE.start_cstrncpy_~us~0#1.base| |ULTIMATE.start_main_#t~malloc10#1.base|) unseeded)} is VALID [2022-02-21 04:35:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:07,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:35:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:07,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:07,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {379#(and (= |ULTIMATE.start_cstrncpy_~us~0#1.base| |ULTIMATE.start_main_#t~malloc10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) (* (- 1) |ULTIMATE.start_cstrncpy_~us~0#1.offset|))))} cstrncpy_#t~post6#1 := cstrncpy_~n2~0#1;cstrncpy_~n2~0#1 := cstrncpy_#t~post6#1 - 1; {379#(and (= |ULTIMATE.start_cstrncpy_~us~0#1.base| |ULTIMATE.start_main_#t~malloc10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) (* (- 1) |ULTIMATE.start_cstrncpy_~us~0#1.offset|))))} is VALID [2022-02-21 04:35:07,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#(and (= |ULTIMATE.start_cstrncpy_~us~0#1.base| |ULTIMATE.start_main_#t~malloc10#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) (* (- 1) |ULTIMATE.start_cstrncpy_~us~0#1.offset|))))} assume !!(0 != cstrncpy_#t~post6#1);havoc cstrncpy_#t~post6#1;cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset := cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset := cstrncpy_#t~post7#1.base, 1 + cstrncpy_#t~post7#1.offset;call write~int(0, cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset, 1);havoc cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset; {381#(and (= |ULTIMATE.start_cstrncpy_~us~0#1.base| |ULTIMATE.start_main_#t~malloc10#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) (* (- 1) |ULTIMATE.start_cstrncpy_~us~0#1.offset|)))) unseeded))} is VALID [2022-02-21 04:35:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:07,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:07,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:07,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:35:07,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,382 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2022-02-21 04:35:07,382 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:07,448 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 18 states and 24 transitions. Complement of second has 6 states. [2022-02-21 04:35:07,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:07,448 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:07,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:07,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:07,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:07,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:07,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:07,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:07,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:07,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2022-02-21 04:35:07,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:07,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:07,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:07,450 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:07,450 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:35:07,450 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:07,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:07,451 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:07,451 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 24 transitions. cyclomatic complexity: 9 [2022-02-21 04:35:07,451 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:07,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:07,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:35:07,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:07,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:07,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:07,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:07,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:07,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:35:07,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:07,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 18 letters. [2022-02-21 04:35:07,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 04:35:07,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 18 letters. [2022-02-21 04:35:07,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:07,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:07,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:07,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:07,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:07,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:07,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:07,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:35:07,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:07,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:07,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:35:07,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:07,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:07,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:35:07,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:07,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:07,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:35:07,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:07,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:07,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:07,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2022-02-21 04:35:07,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:07,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:35:07,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:07,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:07,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:35:07,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:07,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,456 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-02-21 04:35:07,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:07,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:07,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:07,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:07,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. cyclomatic complexity: 9 [2022-02-21 04:35:07,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:07,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 11 states and 14 transitions. [2022-02-21 04:35:07,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 04:35:07,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 04:35:07,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2022-02-21 04:35:07,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:07,458 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 04:35:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2022-02-21 04:35:07,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-21 04:35:07,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:07,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:07,459 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:07,459 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:07,459 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 04:35:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 04:35:07,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:07,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:07,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 14 transitions. [2022-02-21 04:35:07,460 INFO L87 Difference]: Start difference. First operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 14 transitions. [2022-02-21 04:35:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:07,460 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 04:35:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 04:35:07,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:07,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:07,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:07,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2022-02-21 04:35:07,461 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 04:35:07,461 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 04:35:07,461 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:07,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2022-02-21 04:35:07,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:07,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:07,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:07,461 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:07,462 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:07,462 INFO L791 eck$LassoCheckResult]: Stem: 451#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 452#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 453#L535 assume !(main_~length~0#1 < 1); 454#L535-2 assume !(main_~n~0#1 < 1); 450#L538-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 446#L544-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 447#L544-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 448#L544-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 449#L544-4 call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset, cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset, cstrncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstrncpy_#res#1.base, cstrncpy_#res#1.offset;havoc cstrncpy_#t~post2#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, cstrncpy_#t~mem5#1, cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset, cstrncpy_#t~post6#1, cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset, cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset, cstrncpy_~n#1, cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset, cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset, cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset, cstrncpy_~n2~0#1;cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset := cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset;cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset := cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset;cstrncpy_~n#1 := cstrncpy_#in~n#1;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset;havoc cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;havoc cstrncpy_~n2~0#1; 455#L520-2 [2022-02-21 04:35:07,462 INFO L793 eck$LassoCheckResult]: Loop: 455#L520-2 assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post2#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post2#1 - 1;havoc cstrncpy_#t~post2#1;cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post3#1.base, 1 + cstrncpy_#t~post3#1.offset;cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post4#1.base, 1 + cstrncpy_#t~post4#1.offset;call cstrncpy_#t~mem5#1 := read~int(cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, 1);call write~int(cstrncpy_#t~mem5#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, 1); 456#L522 assume !(0 == cstrncpy_#t~mem5#1);havoc cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset;havoc cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset;havoc cstrncpy_#t~mem5#1; 455#L520-2 [2022-02-21 04:35:07,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:07,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2022-02-21 04:35:07,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:07,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170797929] [2022-02-21 04:35:07,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:07,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,494 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:07,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:07,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2195, now seen corresponding path program 2 times [2022-02-21 04:35:07,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:07,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978530254] [2022-02-21 04:35:07,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:07,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,499 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,502 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:07,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:07,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626526, now seen corresponding path program 1 times [2022-02-21 04:35:07,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:07,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984649403] [2022-02-21 04:35:07,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:07,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,514 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,524 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:07,814 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 04:35:08,110 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:08,111 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:08,111 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:08,111 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:08,111 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:08,111 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:08,111 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:08,111 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:08,111 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca-2.i_Iteration4_Lasso [2022-02-21 04:35:08,111 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:08,111 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:08,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,713 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:08,715 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:08,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:09,298 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:09,299 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:09,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,300 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 04:35:09,301 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 04:35:09,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:09,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:09,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:09,310 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,325 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 04:35:09,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,327 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 04:35:09,327 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 04:35:09,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:09,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:09,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,353 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 04:35:09,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,355 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 04:35:09,356 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 04:35:09,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 04:35:09,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:09,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:09,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:09,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:09,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,397 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 04:35:09,398 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 04:35:09,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:09,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:09,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 04:35:09,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,438 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 04:35:09,439 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 04:35:09,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:09,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:09,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:09,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 04:35:09,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,477 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 04:35:09,477 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 04:35:09,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:09,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:09,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:09,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 04:35:09,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,502 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 04:35:09,504 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 04:35:09,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:09,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:09,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:09,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 04:35:09,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,528 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:09,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 04:35:09,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:09,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:09,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:09,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,571 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:09,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 04:35:09,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,580 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 04:35:09,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,585 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 04:35:09,585 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:35:09,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 04:35:09,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,613 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:09,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 04:35:09,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:09,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:09,625 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 04:35:09,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,642 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:09,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 04:35:09,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:09,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:09,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 04:35:09,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,670 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:09,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 04:35:09,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:09,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:09,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:09,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,712 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:09,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 04:35:09,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:09,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:09,739 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:09,756 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-02-21 04:35:09,756 INFO L444 ModelExtractionUtils]: 6 out of 31 variables were initially zero. Simplification set additionally 22 variables to zero. [2022-02-21 04:35:09,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,757 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:09,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 04:35:09,759 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:09,772 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:09,773 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:09,773 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~src~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11#1.base)_3) = -1*ULTIMATE.start_cstrncpy_~src~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11#1.base)_3 Supporting invariants [] [2022-02-21 04:35:09,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-02-21 04:35:09,850 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2022-02-21 04:35:09,855 INFO L390 LassoCheck]: Loop: "assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post2#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post2#1 - 1;havoc cstrncpy_#t~post2#1;cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post3#1.base, 1 + cstrncpy_#t~post3#1.offset;cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post4#1.base, 1 + cstrncpy_#t~post4#1.offset;call cstrncpy_#t~mem5#1 := read~int(cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, 1);call write~int(cstrncpy_#t~mem5#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, 1);" "assume !(0 == cstrncpy_#t~mem5#1);havoc cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset;havoc cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset;havoc cstrncpy_#t~mem5#1;" [2022-02-21 04:35:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:09,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:09,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:35:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:09,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:09,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {488#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {488#unseeded} is VALID [2022-02-21 04:35:09,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {488#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet13#1, main_#t~post12#1, main_~i~0#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {488#unseeded} is VALID [2022-02-21 04:35:09,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {488#unseeded} assume !(main_~length~0#1 < 1); {488#unseeded} is VALID [2022-02-21 04:35:09,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {488#unseeded} assume !(main_~n~0#1 < 1); {488#unseeded} is VALID [2022-02-21 04:35:09,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {488#unseeded} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; {603#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} is VALID [2022-02-21 04:35:09,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {603#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; {603#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} is VALID [2022-02-21 04:35:09,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {603#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {603#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} is VALID [2022-02-21 04:35:09,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {603#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} assume !(main_~i~0#1 < main_~length~0#1 - 1); {603#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} is VALID [2022-02-21 04:35:09,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {603#(and unseeded (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset, cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset, cstrncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstrncpy_#res#1.base, cstrncpy_#res#1.offset;havoc cstrncpy_#t~post2#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, cstrncpy_#t~mem5#1, cstrncpy_#t~post7#1.base, cstrncpy_#t~post7#1.offset, cstrncpy_#t~post6#1, cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset, cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset, cstrncpy_~n#1, cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset, cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset, cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset, cstrncpy_~n2~0#1;cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset := cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset;cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset := cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset;cstrncpy_~n#1 := cstrncpy_#in~n#1;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset;havoc cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;havoc cstrncpy_~n2~0#1; {582#(and (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_cstrncpy_~src~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:09,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:35:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:09,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:10,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {583#(and (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_cstrncpy_~src~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc11#1.base|))))} assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post2#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post2#1 - 1;havoc cstrncpy_#t~post2#1;cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post3#1.base, 1 + cstrncpy_#t~post3#1.offset;cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post4#1.base, 1 + cstrncpy_#t~post4#1.offset;call cstrncpy_#t~mem5#1 := read~int(cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset, 1);call write~int(cstrncpy_#t~mem5#1, cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset, 1); {616#(and (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_cstrncpy_~src~0#1.base|) (<= 1 oldRank0) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc11#1.base|) 1) (+ |ULTIMATE.start_cstrncpy_~src~0#1.offset| oldRank0)))} is VALID [2022-02-21 04:35:10,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#(and (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_cstrncpy_~src~0#1.base|) (<= 1 oldRank0) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc11#1.base|) 1) (+ |ULTIMATE.start_cstrncpy_~src~0#1.offset| oldRank0)))} assume !(0 == cstrncpy_#t~mem5#1);havoc cstrncpy_#t~post3#1.base, cstrncpy_#t~post3#1.offset;havoc cstrncpy_#t~post4#1.base, cstrncpy_#t~post4#1.offset;havoc cstrncpy_#t~mem5#1; {585#(and (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_cstrncpy_~src~0#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc11#1.base|)))) unseeded))} is VALID [2022-02-21 04:35:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:10,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:10,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:10,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:35:10,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,024 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 04:35:10,024 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:10,050 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:35:10,050 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 04:35:10,050 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:10,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:10,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:10,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:10,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:10,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:10,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:10,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:10,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2022-02-21 04:35:10,052 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:10,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:10,052 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:10,052 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:10,052 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:10,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:10,053 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:10,053 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:10,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:10,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:10,053 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:35:10,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:10,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:35:10,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:10,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:10,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:10,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:10,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:35:10,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:35:10,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,054 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 04:35:10,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2022-02-21 04:35:10,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 letters. [2022-02-21 04:35:10,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2022-02-21 04:35:10,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:10,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:35:10,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,054 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 04:35:10,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:10,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:35:10,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:10,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:10,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 04:35:10,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,055 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 04:35:10,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:10,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:10,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:10,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,057 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:10,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-02-21 04:35:10,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:10,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:10,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:10,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:10,059 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:10,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2022-02-21 04:35:10,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:35:10,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:35:10,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:35:10,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:10,060 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:10,060 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:10,060 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:10,060 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:35:10,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:35:10,060 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:10,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:10,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:35:10 BoogieIcfgContainer [2022-02-21 04:35:10,065 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:35:10,066 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:35:10,066 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:35:10,066 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:35:10,066 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:01" (3/4) ... [2022-02-21 04:35:10,068 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:35:10,068 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:35:10,069 INFO L158 Benchmark]: Toolchain (without parser) took 9376.67ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 59.0MB in the beginning and 72.0MB in the end (delta: -12.9MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2022-02-21 04:35:10,069 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory was 47.3MB in the beginning and 47.3MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:10,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.74ms. Allocated memory is still 92.3MB. Free memory was 58.9MB in the beginning and 60.7MB in the end (delta: -1.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:35:10,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.02ms. Allocated memory is still 92.3MB. Free memory was 60.7MB in the beginning and 58.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:10,070 INFO L158 Benchmark]: Boogie Preprocessor took 41.29ms. Allocated memory is still 92.3MB. Free memory was 58.4MB in the beginning and 56.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:10,070 INFO L158 Benchmark]: RCFGBuilder took 397.15ms. Allocated memory was 92.3MB in the beginning and 127.9MB in the end (delta: 35.7MB). Free memory was 56.9MB in the beginning and 101.6MB in the end (delta: -44.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 04:35:10,070 INFO L158 Benchmark]: BuchiAutomizer took 8540.33ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 101.6MB in the beginning and 72.0MB in the end (delta: 29.7MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2022-02-21 04:35:10,070 INFO L158 Benchmark]: Witness Printer took 2.46ms. Allocated memory is still 161.5MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:10,071 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.16ms. Allocated memory is still 92.3MB. Free memory was 47.3MB in the beginning and 47.3MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.74ms. Allocated memory is still 92.3MB. Free memory was 58.9MB in the beginning and 60.7MB in the end (delta: -1.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.02ms. Allocated memory is still 92.3MB. Free memory was 60.7MB in the beginning and 58.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.29ms. Allocated memory is still 92.3MB. Free memory was 58.4MB in the beginning and 56.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 397.15ms. Allocated memory was 92.3MB in the beginning and 127.9MB in the end (delta: 35.7MB). Free memory was 56.9MB in the beginning and 101.6MB in the end (delta: -44.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 8540.33ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 101.6MB in the beginning and 72.0MB in the end (delta: 29.7MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. * Witness Printer took 2.46ms. Allocated memory is still 161.5MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] + -1 * us and consists of 5 locations. One deterministic module has affine ranking function -1 * src + unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 7.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 116 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 49 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital201 mio100 ax109 hnf100 lsp86 ukn89 mio100 lsp44 div100 bol100 ite100 ukn100 eq182 hnf89 smp97 dnf111 smp100 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 205ms VariablesStem: 21 VariablesLoop: 13 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:35:10,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:10,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE