./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/openbsd_cstrlcpy-alloca-1.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 a775ba6b744ab5ffb556747687a592ac2a696b9fe34bb3e21dc1471ba5c99e1a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 22:50:05,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 22:50:05,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 22:50:05,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 22:50:05,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 22:50:05,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 22:50:05,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 22:50:05,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 22:50:05,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 22:50:05,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 22:50:05,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 22:50:05,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 22:50:05,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 22:50:05,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 22:50:05,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 22:50:05,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 22:50:05,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 22:50:05,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 22:50:05,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 22:50:05,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 22:50:05,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 22:50:05,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 22:50:05,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 22:50:05,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 22:50:05,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 22:50:05,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 22:50:05,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 22:50:05,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 22:50:05,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 22:50:05,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 22:50:05,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 22:50:05,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 22:50:05,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 22:50:05,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 22:50:05,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 22:50:05,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 22:50:05,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 22:50:05,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 22:50:05,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 22:50:05,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 22:50:05,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 22:50:05,250 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-21 22:50:05,275 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 22:50:05,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 22:50:05,276 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 22:50:05,276 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 22:50:05,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 22:50:05,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 22:50:05,277 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 22:50:05,277 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-21 22:50:05,277 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-21 22:50:05,278 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-21 22:50:05,278 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-21 22:50:05,278 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-21 22:50:05,279 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-21 22:50:05,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 22:50:05,279 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 22:50:05,279 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 22:50:05,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 22:50:05,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 22:50:05,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 22:50:05,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-21 22:50:05,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-21 22:50:05,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-21 22:50:05,280 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 22:50:05,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 22:50:05,280 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-21 22:50:05,280 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 22:50:05,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-21 22:50:05,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 22:50:05,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 22:50:05,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 22:50:05,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 22:50:05,281 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 22:50:05,282 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-21 22:50:05,282 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 -> a775ba6b744ab5ffb556747687a592ac2a696b9fe34bb3e21dc1471ba5c99e1a [2021-12-21 22:50:05,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 22:50:05,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 22:50:05,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 22:50:05,486 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 22:50:05,486 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 22:50:05,487 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i [2021-12-21 22:50:05,533 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea74ff750/de45ab8ed0cf4e7fab6bd97166951d27/FLAGa3cb91931 [2021-12-21 22:50:05,944 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 22:50:05,945 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i [2021-12-21 22:50:05,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea74ff750/de45ab8ed0cf4e7fab6bd97166951d27/FLAGa3cb91931 [2021-12-21 22:50:06,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea74ff750/de45ab8ed0cf4e7fab6bd97166951d27 [2021-12-21 22:50:06,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 22:50:06,332 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 22:50:06,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 22:50:06,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 22:50:06,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 22:50:06,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:50:06" (1/1) ... [2021-12-21 22:50:06,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c40c747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:06, skipping insertion in model container [2021-12-21 22:50:06,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:50:06" (1/1) ... [2021-12-21 22:50:06,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 22:50:06,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 22:50:06,536 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:50:06,542 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 22:50:06,590 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:50:06,614 INFO L208 MainTranslator]: Completed translation [2021-12-21 22:50:06,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:06 WrapperNode [2021-12-21 22:50:06,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 22:50:06,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 22:50:06,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 22:50:06,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 22:50:06,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:06" (1/1) ... [2021-12-21 22:50:06,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:06" (1/1) ... [2021-12-21 22:50:06,661 INFO L137 Inliner]: procedures = 117, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2021-12-21 22:50:06,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 22:50:06,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 22:50:06,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 22:50:06,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 22:50:06,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:06" (1/1) ... [2021-12-21 22:50:06,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:06" (1/1) ... [2021-12-21 22:50:06,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:06" (1/1) ... [2021-12-21 22:50:06,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:06" (1/1) ... [2021-12-21 22:50:06,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:06" (1/1) ... [2021-12-21 22:50:06,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:06" (1/1) ... [2021-12-21 22:50:06,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:06" (1/1) ... [2021-12-21 22:50:06,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 22:50:06,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 22:50:06,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 22:50:06,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 22:50:06,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:06" (1/1) ... [2021-12-21 22:50:06,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:06,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:06,728 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) [2021-12-21 22:50:06,733 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 [2021-12-21 22:50:06,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 22:50:06,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 22:50:06,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 22:50:06,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 22:50:06,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 22:50:06,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 22:50:06,810 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 22:50:06,812 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 22:50:06,998 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 22:50:07,002 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 22:50:07,002 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-21 22:50:07,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:50:07 BoogieIcfgContainer [2021-12-21 22:50:07,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 22:50:07,005 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-21 22:50:07,005 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-21 22:50:07,007 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-21 22:50:07,007 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:50:07,008 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.12 10:50:06" (1/3) ... [2021-12-21 22:50:07,009 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28e81c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:50:07, skipping insertion in model container [2021-12-21 22:50:07,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:50:07,009 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:50:06" (2/3) ... [2021-12-21 22:50:07,009 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28e81c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:50:07, skipping insertion in model container [2021-12-21 22:50:07,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:50:07,009 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:50:07" (3/3) ... [2021-12-21 22:50:07,010 INFO L388 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca-1.i [2021-12-21 22:50:07,059 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-21 22:50:07,059 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-21 22:50:07,059 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-21 22:50:07,059 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-21 22:50:07,059 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-21 22:50:07,059 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-21 22:50:07,060 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-21 22:50:07,060 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-21 22:50:07,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:07,093 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2021-12-21 22:50:07,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:07,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:07,097 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-21 22:50:07,098 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:50:07,098 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-21 22:50:07,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:07,101 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2021-12-21 22:50:07,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:07,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:07,103 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-21 22:50:07,103 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:50:07,107 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 14#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~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 22#L536true assume !(main_~length~0#1 < 1); 8#L536-2true assume !(main_~n~1#1 < 1); 9#L539-1true call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~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_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 5#L545-3true [2021-12-21 22:50:07,108 INFO L793 eck$LassoCheckResult]: Loop: 5#L545-3true assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 11#L545-2true main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 5#L545-3true [2021-12-21 22:50:07,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:07,117 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2021-12-21 22:50:07,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:07,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792638089] [2021-12-21 22:50:07,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:07,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:07,227 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:07,265 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:07,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:07,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2021-12-21 22:50:07,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:07,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844470762] [2021-12-21 22:50:07,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:07,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:07,285 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:07,300 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:07,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:07,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2021-12-21 22:50:07,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:07,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417462475] [2021-12-21 22:50:07,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:07,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:07,325 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:07,345 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:07,662 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:50:07,663 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:50:07,663 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:50:07,663 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:50:07,663 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:50:07,663 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:07,664 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:50:07,664 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:50:07,664 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca-1.i_Iteration1_Lasso [2021-12-21 22:50:07,664 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:50:07,664 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:50:07,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:07,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:07,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:07,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:07,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:07,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:07,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:07,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:07,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:07,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:07,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:07,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:07,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:07,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:07,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:08,019 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:50:08,022 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:50:08,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:08,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:08,025 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) [2021-12-21 22:50:08,025 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 [2021-12-21 22:50:08,030 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 [2021-12-21 22:50:08,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:08,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:08,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:08,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:08,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:08,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:08,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:08,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:08,064 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 [2021-12-21 22:50:08,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:08,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:08,067 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) [2021-12-21 22:50:08,069 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 [2021-12-21 22:50:08,070 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 [2021-12-21 22:50:08,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:08,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:08,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:08,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:08,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:08,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:08,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:08,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:08,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-21 22:50:08,116 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:08,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:08,117 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) [2021-12-21 22:50:08,118 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 [2021-12-21 22:50:08,123 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 [2021-12-21 22:50:08,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:08,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:08,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:08,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:08,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:08,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:08,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:08,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:08,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2021-12-21 22:50:08,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:08,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:08,156 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) [2021-12-21 22:50:08,156 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 [2021-12-21 22:50:08,158 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 [2021-12-21 22:50:08,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:08,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:08,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:08,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:08,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:08,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:08,191 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 22:50:08,226 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2021-12-21 22:50:08,226 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-12-21 22:50:08,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:08,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:08,228 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) [2021-12-21 22:50:08,229 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 [2021-12-21 22:50:08,231 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 22:50:08,252 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-21 22:50:08,252 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 22:50:08,253 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nondetString2~0#1.offset, ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_1) = -1*ULTIMATE.start_main_~nondetString2~0#1.offset - 1*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_1 Supporting invariants [] [2021-12-21 22:50:08,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:08,303 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2021-12-21 22:50:08,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:08,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 22:50:08,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:08,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 22:50:08,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:50:08,405 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 [2021-12-21 22:50:08,406 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 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) [2021-12-21 22:50:08,447 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 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 60 states and 93 transitions. Complement of second has 7 states. [2021-12-21 22:50:08,448 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 [2021-12-21 22:50:08,451 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) [2021-12-21 22:50:08,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2021-12-21 22:50:08,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 5 letters. Loop has 2 letters. [2021-12-21 22:50:08,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:50:08,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 7 letters. Loop has 2 letters. [2021-12-21 22:50:08,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:50:08,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 5 letters. Loop has 4 letters. [2021-12-21 22:50:08,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:50:08,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 93 transitions. [2021-12-21 22:50:08,457 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-12-21 22:50:08,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 29 transitions. [2021-12-21 22:50:08,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-21 22:50:08,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-21 22:50:08,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2021-12-21 22:50:08,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:08,461 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-12-21 22:50:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2021-12-21 22:50:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-21 22:50:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2021-12-21 22:50:08,477 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-12-21 22:50:08,477 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-12-21 22:50:08,477 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-21 22:50:08,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2021-12-21 22:50:08,478 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-12-21 22:50:08,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:08,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:08,478 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:08,479 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:50:08,479 INFO L791 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 161#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~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 172#L536 assume !(main_~length~0#1 < 1); 164#L536-2 assume !(main_~n~1#1 < 1); 165#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~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_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 156#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 157#L545-4 main_~i~1#1 := 0; 168#L550-3 [2021-12-21 22:50:08,479 INFO L793 eck$LassoCheckResult]: Loop: 168#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 169#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 168#L550-3 [2021-12-21 22:50:08,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:08,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2021-12-21 22:50:08,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:08,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408277706] [2021-12-21 22:50:08,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:08,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:08,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:08,505 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:08,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:08,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2021-12-21 22:50:08,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:08,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201188734] [2021-12-21 22:50:08,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:08,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:08,510 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:08,514 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:08,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:08,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2021-12-21 22:50:08,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:08,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25575413] [2021-12-21 22:50:08,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:08,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:08,527 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:08,539 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:08,554 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 [2021-12-21 22:50:08,789 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:50:08,789 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:50:08,789 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:50:08,789 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:50:08,789 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:50:08,789 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:08,789 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:50:08,789 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:50:08,790 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca-1.i_Iteration2_Lasso [2021-12-21 22:50:08,790 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:50:08,790 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:50:08,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:08,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:08,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:08,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:08,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:08,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:08,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:08,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:08,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:08,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:08,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:08,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:08,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:08,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:09,128 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:50:09,128 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:50:09,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:09,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:09,130 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) [2021-12-21 22:50:09,131 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 [2021-12-21 22:50:09,132 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 [2021-12-21 22:50:09,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:09,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:09,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:09,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:09,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:09,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:09,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:09,181 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 [2021-12-21 22:50:09,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:09,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:09,183 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) [2021-12-21 22:50:09,189 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 [2021-12-21 22:50:09,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:09,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:09,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:09,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:09,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:09,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:09,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:09,200 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 [2021-12-21 22:50:09,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:09,229 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 [2021-12-21 22:50:09,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:09,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:09,231 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) [2021-12-21 22:50:09,232 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 [2021-12-21 22:50:09,233 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 [2021-12-21 22:50:09,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:09,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:09,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:09,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:09,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:09,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:09,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:09,282 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 [2021-12-21 22:50:09,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:09,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:09,284 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) [2021-12-21 22:50:09,286 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 [2021-12-21 22:50:09,288 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 [2021-12-21 22:50:09,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:09,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:09,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:09,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:09,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:09,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:09,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:09,310 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:09,328 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 [2021-12-21 22:50:09,328 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:09,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:09,330 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) [2021-12-21 22:50:09,331 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 [2021-12-21 22:50:09,332 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 [2021-12-21 22:50:09,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:09,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:09,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:09,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:09,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:09,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:09,358 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 22:50:09,388 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-12-21 22:50:09,389 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-12-21 22:50:09,389 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:09,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:09,390 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) [2021-12-21 22:50:09,391 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 [2021-12-21 22:50:09,415 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 22:50:09,436 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-21 22:50:09,437 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 22:50:09,437 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [1*ULTIMATE.start_main_~nondetString1~0#1.offset >= 0] [2021-12-21 22:50:09,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:09,464 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2021-12-21 22:50:09,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:09,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 22:50:09,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:09,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 22:50:09,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:50:09,541 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 [2021-12-21 22:50:09,541 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:09,571 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 48 transitions. Complement of second has 7 states. [2021-12-21 22:50:09,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-21 22:50:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2021-12-21 22:50:09,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2021-12-21 22:50:09,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:50:09,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 9 letters. Loop has 2 letters. [2021-12-21 22:50:09,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:50:09,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 4 letters. [2021-12-21 22:50:09,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:50:09,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 48 transitions. [2021-12-21 22:50:09,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-21 22:50:09,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 31 transitions. [2021-12-21 22:50:09,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-12-21 22:50:09,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-21 22:50:09,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 31 transitions. [2021-12-21 22:50:09,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:09,575 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2021-12-21 22:50:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 31 transitions. [2021-12-21 22:50:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-21 22:50:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2021-12-21 22:50:09,577 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2021-12-21 22:50:09,577 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2021-12-21 22:50:09,577 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-21 22:50:09,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 31 transitions. [2021-12-21 22:50:09,577 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-21 22:50:09,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:09,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:09,578 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:09,578 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:50:09,578 INFO L791 eck$LassoCheckResult]: Stem: 296#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 297#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~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 309#L536 assume !(main_~length~0#1 < 1); 300#L536-2 assume !(main_~n~1#1 < 1); 301#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~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_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 292#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 293#L545-4 main_~i~1#1 := 0; 306#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 302#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 303#L519 assume 0 != cstrlcpy_~n~0#1 % 4294967296; 298#L520-3 [2021-12-21 22:50:09,579 INFO L793 eck$LassoCheckResult]: Loop: 298#L520-3 cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1; 299#L520-1 assume !!(0 != cstrlcpy_#t~pre2#1 % 4294967296);havoc cstrlcpy_#t~pre2#1;cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset := cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_#t~post3#1.base, 1 + cstrlcpy_#t~post3#1.offset;cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post4#1.base, 1 + cstrlcpy_#t~post4#1.offset;call cstrlcpy_#t~mem5#1 := read~int(cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, 1);call write~int(cstrlcpy_#t~mem5#1, cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, 1); 310#L521 assume !(0 == cstrlcpy_#t~mem5#1);havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset;havoc cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset;havoc cstrlcpy_#t~mem5#1; 298#L520-3 [2021-12-21 22:50:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:09,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1595220888, now seen corresponding path program 1 times [2021-12-21 22:50:09,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:09,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034809302] [2021-12-21 22:50:09,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:09,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:09,593 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:09,606 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:09,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:09,607 INFO L85 PathProgramCache]: Analyzing trace with hash 80599, now seen corresponding path program 1 times [2021-12-21 22:50:09,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:09,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994900635] [2021-12-21 22:50:09,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:09,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:09,616 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:09,624 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:09,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:09,625 INFO L85 PathProgramCache]: Analyzing trace with hash -587605024, now seen corresponding path program 1 times [2021-12-21 22:50:09,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:09,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57660306] [2021-12-21 22:50:09,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:09,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:50:09,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:09,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57660306] [2021-12-21 22:50:09,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57660306] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:50:09,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:50:09,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 22:50:09,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249956166] [2021-12-21 22:50:09,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:50:09,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:09,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 22:50:09,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-21 22:50:09,826 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. cyclomatic complexity: 14 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:09,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-12-21 22:50:09,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:50:09,963 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2021-12-21 22:50:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 22:50:09,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 49 transitions. [2021-12-21 22:50:09,966 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-12-21 22:50:09,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 49 transitions. [2021-12-21 22:50:09,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-12-21 22:50:09,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-12-21 22:50:09,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 49 transitions. [2021-12-21 22:50:09,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:09,967 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 49 transitions. [2021-12-21 22:50:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 49 transitions. [2021-12-21 22:50:09,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2021-12-21 22:50:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2021-12-21 22:50:09,969 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2021-12-21 22:50:09,969 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2021-12-21 22:50:09,969 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-21 22:50:09,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2021-12-21 22:50:09,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-21 22:50:09,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:09,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:09,971 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:09,971 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:50:09,971 INFO L791 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 372#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~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 388#L536 assume !(main_~length~0#1 < 1); 375#L536-2 assume !(main_~n~1#1 < 1); 377#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~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_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 367#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 368#L545-4 main_~i~1#1 := 0; 393#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 385#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 384#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 378#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 379#L519 assume 0 != cstrlcpy_~n~0#1 % 4294967296; 373#L520-3 [2021-12-21 22:50:09,971 INFO L793 eck$LassoCheckResult]: Loop: 373#L520-3 cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1; 374#L520-1 assume !!(0 != cstrlcpy_#t~pre2#1 % 4294967296);havoc cstrlcpy_#t~pre2#1;cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset := cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_#t~post3#1.base, 1 + cstrlcpy_#t~post3#1.offset;cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post4#1.base, 1 + cstrlcpy_#t~post4#1.offset;call cstrlcpy_#t~mem5#1 := read~int(cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, 1);call write~int(cstrlcpy_#t~mem5#1, cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, 1); 389#L521 assume !(0 == cstrlcpy_#t~mem5#1);havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset;havoc cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset;havoc cstrlcpy_#t~mem5#1; 373#L520-3 [2021-12-21 22:50:09,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:09,972 INFO L85 PathProgramCache]: Analyzing trace with hash -294332618, now seen corresponding path program 1 times [2021-12-21 22:50:09,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:09,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937889476] [2021-12-21 22:50:09,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:09,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:09,984 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:09,994 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:09,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:09,995 INFO L85 PathProgramCache]: Analyzing trace with hash 80599, now seen corresponding path program 2 times [2021-12-21 22:50:09,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:09,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377468667] [2021-12-21 22:50:09,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:09,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:10,000 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:10,005 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:10,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:10,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1860246402, now seen corresponding path program 1 times [2021-12-21 22:50:10,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:10,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653517417] [2021-12-21 22:50:10,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:10,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:10,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:10,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653517417] [2021-12-21 22:50:10,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653517417] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:50:10,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:50:10,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 22:50:10,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188421133] [2021-12-21 22:50:10,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:50:10,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:10,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 22:50:10,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-21 22:50:10,193 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. cyclomatic complexity: 17 Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:50:10,245 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2021-12-21 22:50:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 22:50:10,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 73 transitions. [2021-12-21 22:50:10,247 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-12-21 22:50:10,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 73 transitions. [2021-12-21 22:50:10,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-12-21 22:50:10,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-12-21 22:50:10,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 73 transitions. [2021-12-21 22:50:10,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:10,249 INFO L681 BuchiCegarLoop]: Abstraction has 55 states and 73 transitions. [2021-12-21 22:50:10,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 73 transitions. [2021-12-21 22:50:10,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2021-12-21 22:50:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.4) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2021-12-21 22:50:10,252 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2021-12-21 22:50:10,252 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2021-12-21 22:50:10,252 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-21 22:50:10,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 56 transitions. [2021-12-21 22:50:10,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-21 22:50:10,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:10,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:10,253 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:10,253 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:50:10,253 INFO L791 eck$LassoCheckResult]: Stem: 473#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 474#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~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 491#L536 assume !(main_~length~0#1 < 1); 477#L536-2 assume main_~n~1#1 < 1;main_~n~1#1 := 1; 478#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~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_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 469#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 470#L545-4 main_~i~1#1 := 0; 485#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 481#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 482#L519 assume 0 != cstrlcpy_~n~0#1 % 4294967296; 475#L520-3 cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1; 476#L520-1 assume !(0 != cstrlcpy_#t~pre2#1 % 4294967296);havoc cstrlcpy_#t~pre2#1; 493#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 494#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 489#L528-2 [2021-12-21 22:50:10,253 INFO L793 eck$LassoCheckResult]: Loop: 489#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 490#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 489#L528-2 [2021-12-21 22:50:10,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:10,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1736952706, now seen corresponding path program 1 times [2021-12-21 22:50:10,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:10,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939732068] [2021-12-21 22:50:10,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:10,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:50:10,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:10,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939732068] [2021-12-21 22:50:10,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939732068] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:50:10,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:50:10,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:50:10,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217704149] [2021-12-21 22:50:10,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:50:10,289 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:50:10,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:10,289 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 1 times [2021-12-21 22:50:10,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:10,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437911008] [2021-12-21 22:50:10,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:10,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:10,292 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:10,294 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:10,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:10,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:50:10,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 22:50:10,323 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. cyclomatic complexity: 22 Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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) [2021-12-21 22:50:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:50:10,346 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2021-12-21 22:50:10,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 22:50:10,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2021-12-21 22:50:10,348 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-12-21 22:50:10,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 64 transitions. [2021-12-21 22:50:10,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2021-12-21 22:50:10,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2021-12-21 22:50:10,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2021-12-21 22:50:10,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:10,349 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2021-12-21 22:50:10,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2021-12-21 22:50:10,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2021-12-21 22:50:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2021-12-21 22:50:10,352 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2021-12-21 22:50:10,352 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2021-12-21 22:50:10,352 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-21 22:50:10,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 62 transitions. [2021-12-21 22:50:10,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-21 22:50:10,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:10,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:10,353 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:10,353 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:50:10,353 INFO L791 eck$LassoCheckResult]: Stem: 571#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 572#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~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 589#L536 assume !(main_~length~0#1 < 1); 575#L536-2 assume main_~n~1#1 < 1;main_~n~1#1 := 1; 576#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~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_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 599#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 594#L545-4 main_~i~1#1 := 0; 582#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 583#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 603#L519 assume 0 != cstrlcpy_~n~0#1 % 4294967296; 602#L520-3 cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1; 601#L520-1 assume !(0 != cstrlcpy_#t~pre2#1 % 4294967296);havoc cstrlcpy_#t~pre2#1; 595#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 592#L526 assume 0 != cstrlcpy_~siz#1 % 4294967296;call write~int(0, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, 1); 587#L528-2 [2021-12-21 22:50:10,353 INFO L793 eck$LassoCheckResult]: Loop: 587#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 588#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 587#L528-2 [2021-12-21 22:50:10,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:10,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1736952708, now seen corresponding path program 1 times [2021-12-21 22:50:10,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:10,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543405242] [2021-12-21 22:50:10,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:10,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:10,365 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:10,374 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:10,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:10,375 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 2 times [2021-12-21 22:50:10,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:10,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64397737] [2021-12-21 22:50:10,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:10,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:10,378 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:10,380 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:10,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:10,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1530728321, now seen corresponding path program 1 times [2021-12-21 22:50:10,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:10,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125408937] [2021-12-21 22:50:10,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:10,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:50:10,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:10,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125408937] [2021-12-21 22:50:10,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125408937] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:50:10,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:50:10,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 22:50:10,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945008928] [2021-12-21 22:50:10,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:50:10,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:10,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 22:50:10,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 22:50:10,523 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. cyclomatic complexity: 22 Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:10,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:50:10,598 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2021-12-21 22:50:10,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 22:50:10,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 85 transitions. [2021-12-21 22:50:10,599 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-12-21 22:50:10,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 52 states and 65 transitions. [2021-12-21 22:50:10,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-12-21 22:50:10,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-12-21 22:50:10,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 65 transitions. [2021-12-21 22:50:10,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:10,600 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 65 transitions. [2021-12-21 22:50:10,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 65 transitions. [2021-12-21 22:50:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2021-12-21 22:50:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 45 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2021-12-21 22:50:10,603 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2021-12-21 22:50:10,603 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2021-12-21 22:50:10,603 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-21 22:50:10,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2021-12-21 22:50:10,603 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-21 22:50:10,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:10,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:10,604 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:10,604 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-21 22:50:10,604 INFO L791 eck$LassoCheckResult]: Stem: 701#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 702#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~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 716#L536 assume !(main_~length~0#1 < 1); 705#L536-2 assume !(main_~n~1#1 < 1); 707#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~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_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 726#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 725#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 723#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 724#L545-4 main_~i~1#1 := 0; 741#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 737#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 736#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 734#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 731#L519 assume 0 != cstrlcpy_~n~0#1 % 4294967296; 732#L520-3 [2021-12-21 22:50:10,604 INFO L793 eck$LassoCheckResult]: Loop: 732#L520-3 cstrlcpy_#t~pre2#1 := cstrlcpy_~n~0#1 - 1;cstrlcpy_~n~0#1 := cstrlcpy_~n~0#1 - 1; 742#L520-1 assume !!(0 != cstrlcpy_#t~pre2#1 % 4294967296);havoc cstrlcpy_#t~pre2#1;cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset := cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_#t~post3#1.base, 1 + cstrlcpy_#t~post3#1.offset;cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post4#1.base, 1 + cstrlcpy_#t~post4#1.offset;call cstrlcpy_#t~mem5#1 := read~int(cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, 1);call write~int(cstrlcpy_#t~mem5#1, cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, 1); 738#L521 assume !(0 == cstrlcpy_#t~mem5#1);havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset;havoc cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset;havoc cstrlcpy_#t~mem5#1; 732#L520-3 [2021-12-21 22:50:10,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1313217428, now seen corresponding path program 1 times [2021-12-21 22:50:10,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:10,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504245813] [2021-12-21 22:50:10,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:10,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:10,615 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:10,623 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:10,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:10,623 INFO L85 PathProgramCache]: Analyzing trace with hash 80599, now seen corresponding path program 3 times [2021-12-21 22:50:10,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:10,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459687796] [2021-12-21 22:50:10,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:10,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:10,628 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:10,631 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:10,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash -796650908, now seen corresponding path program 1 times [2021-12-21 22:50:10,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:10,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626285124] [2021-12-21 22:50:10,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:10,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:10,665 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:10,675 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:11,452 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:50:11,452 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:50:11,452 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:50:11,452 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:50:11,452 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:50:11,452 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:11,452 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:50:11,452 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:50:11,452 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca-1.i_Iteration7_Lasso [2021-12-21 22:50:11,453 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:50:11,453 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:50:11,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:11,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:50:12,763 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:50:12,763 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:50:12,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:12,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:12,765 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) [2021-12-21 22:50:12,766 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 [2021-12-21 22:50:12,779 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 [2021-12-21 22:50:12,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:12,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:12,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:12,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:12,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:12,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:12,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:12,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-12-21 22:50:12,809 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:12,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:12,810 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) [2021-12-21 22:50:12,810 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 [2021-12-21 22:50:12,812 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 [2021-12-21 22:50:12,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:12,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:12,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:12,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:12,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:12,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:12,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:12,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:12,835 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 [2021-12-21 22:50:12,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:12,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:12,836 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) [2021-12-21 22:50:12,843 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 [2021-12-21 22:50:12,843 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 [2021-12-21 22:50:12,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:12,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:12,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:12,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:12,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:12,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:12,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:12,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:12,866 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 [2021-12-21 22:50:12,867 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:12,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:12,868 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) [2021-12-21 22:50:12,868 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 [2021-12-21 22:50:12,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 [2021-12-21 22:50:12,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:12,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:12,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:12,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:12,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:12,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:12,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:12,878 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:12,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:12,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:12,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:12,900 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) [2021-12-21 22:50:12,902 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 [2021-12-21 22:50:12,904 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 [2021-12-21 22:50:12,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:12,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:12,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:12,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:12,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:12,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:12,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:12,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:12,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:12,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:12,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:12,933 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) [2021-12-21 22:50:12,934 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 [2021-12-21 22:50:12,934 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 [2021-12-21 22:50:12,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:12,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:12,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:12,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:12,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:12,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:12,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:12,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:12,959 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 [2021-12-21 22:50:12,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:12,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:12,961 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) [2021-12-21 22:50:12,962 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 [2021-12-21 22:50:12,963 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 [2021-12-21 22:50:12,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:12,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:12,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:12,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:12,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:12,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:12,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:12,987 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 [2021-12-21 22:50:12,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:12,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:12,988 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) [2021-12-21 22:50:12,992 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 [2021-12-21 22:50:12,992 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 [2021-12-21 22:50:12,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:12,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:12,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:12,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:12,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:12,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:12,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:12,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,014 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 [2021-12-21 22:50:13,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,015 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) [2021-12-21 22:50:13,016 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 [2021-12-21 22:50:13,017 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 [2021-12-21 22:50:13,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:13,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:13,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:13,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,040 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 [2021-12-21 22:50:13,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,041 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) [2021-12-21 22:50:13,041 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 [2021-12-21 22:50:13,043 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 [2021-12-21 22:50:13,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:13,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:13,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:13,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,078 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 [2021-12-21 22:50:13,079 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,079 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) [2021-12-21 22:50:13,080 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 [2021-12-21 22:50:13,081 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 [2021-12-21 22:50:13,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:13,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:13,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:13,088 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-12-21 22:50:13,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,104 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) [2021-12-21 22:50:13,105 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 [2021-12-21 22:50:13,106 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 [2021-12-21 22:50:13,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:13,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:13,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:13,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-21 22:50:13,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,130 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) [2021-12-21 22:50:13,136 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 [2021-12-21 22:50:13,142 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 [2021-12-21 22:50:13,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:13,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:13,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,160 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 [2021-12-21 22:50:13,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,162 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) [2021-12-21 22:50:13,163 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 [2021-12-21 22:50:13,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:13,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:13,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:13,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:13,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,186 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 [2021-12-21 22:50:13,186 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,187 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) [2021-12-21 22:50:13,188 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 [2021-12-21 22:50:13,189 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 [2021-12-21 22:50:13,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:13,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:13,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:13,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,212 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 [2021-12-21 22:50:13,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,213 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) [2021-12-21 22:50:13,213 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 [2021-12-21 22:50:13,217 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 [2021-12-21 22:50:13,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:13,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:13,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:13,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,249 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 [2021-12-21 22:50:13,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,250 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) [2021-12-21 22:50:13,252 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 [2021-12-21 22:50:13,252 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 [2021-12-21 22:50:13,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:13,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:13,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:13,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,290 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) [2021-12-21 22:50:13,292 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 [2021-12-21 22:50:13,293 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 [2021-12-21 22:50:13,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:13,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:13,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:13,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-21 22:50:13,316 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,317 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) [2021-12-21 22:50:13,318 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 [2021-12-21 22:50:13,319 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 [2021-12-21 22:50:13,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:13,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:13,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:13,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,341 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 [2021-12-21 22:50:13,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,342 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) [2021-12-21 22:50:13,343 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 [2021-12-21 22:50:13,345 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 [2021-12-21 22:50:13,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:13,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:13,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:13,352 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:13,369 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,369 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) [2021-12-21 22:50:13,370 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 [2021-12-21 22:50:13,372 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 [2021-12-21 22:50:13,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:13,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:13,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:13,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:13,394 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,395 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) [2021-12-21 22:50:13,395 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 [2021-12-21 22:50:13,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:13,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:50:13,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:50:13,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:50:13,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,420 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 [2021-12-21 22:50:13,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,421 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) [2021-12-21 22:50:13,424 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 [2021-12-21 22:50:13,425 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 [2021-12-21 22:50:13,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:13,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:13,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-12-21 22:50:13,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,460 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) [2021-12-21 22:50:13,460 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 [2021-12-21 22:50:13,491 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 [2021-12-21 22:50:13,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:13,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:13,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,517 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 [2021-12-21 22:50:13,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,519 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) [2021-12-21 22:50:13,520 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 [2021-12-21 22:50:13,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 [2021-12-21 22:50:13,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:13,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:13,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,550 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 [2021-12-21 22:50:13,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,552 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) [2021-12-21 22:50:13,552 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 [2021-12-21 22:50:13,554 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 [2021-12-21 22:50:13,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:13,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:13,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-21 22:50:13,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,582 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) [2021-12-21 22:50:13,583 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 [2021-12-21 22:50:13,584 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 [2021-12-21 22:50:13,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:13,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:13,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:50:13,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-12-21 22:50:13,631 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,631 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) [2021-12-21 22:50:13,634 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 [2021-12-21 22:50:13,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:50:13,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:50:13,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:50:13,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:50:13,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:50:13,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:50:13,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:50:13,683 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 22:50:13,783 INFO L443 ModelExtractionUtils]: Simplification made 29 calls to the SMT solver. [2021-12-21 22:50:13,783 INFO L444 ModelExtractionUtils]: 12 out of 67 variables were initially zero. Simplification set additionally 52 variables to zero. [2021-12-21 22:50:13,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:50:13,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:13,785 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) [2021-12-21 22:50:13,787 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 22:50:13,796 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 [2021-12-21 22:50:13,805 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-21 22:50:13,805 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 22:50:13,805 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrlcpy_~s~0#1.base)_1, ULTIMATE.start_cstrlcpy_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrlcpy_~s~0#1.base)_1 - 1*ULTIMATE.start_cstrlcpy_~s~0#1.offset Supporting invariants [] [2021-12-21 22:50:13,823 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 [2021-12-21 22:50:13,878 INFO L297 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2021-12-21 22:50:13,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:13,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 22:50:13,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:13,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 22:50:13,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:50:13,956 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 [2021-12-21 22:50:13,956 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:13,964 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 64 states and 83 transitions. Complement of second has 4 states. [2021-12-21 22:50:13,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-21 22:50:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2021-12-21 22:50:13,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 14 letters. Loop has 3 letters. [2021-12-21 22:50:13,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:50:13,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 17 letters. Loop has 3 letters. [2021-12-21 22:50:13,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:50:13,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 14 letters. Loop has 6 letters. [2021-12-21 22:50:13,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:50:13,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 83 transitions. [2021-12-21 22:50:13,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:50:13,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 18 states and 22 transitions. [2021-12-21 22:50:13,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-21 22:50:13,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-21 22:50:13,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2021-12-21 22:50:13,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:13,968 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-21 22:50:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2021-12-21 22:50:13,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-21 22:50:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-21 22:50:13,969 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-21 22:50:13,969 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-21 22:50:13,969 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-21 22:50:13,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2021-12-21 22:50:13,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:50:13,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:13,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:13,970 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:13,970 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:50:13,970 INFO L791 eck$LassoCheckResult]: Stem: 970#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 971#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~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 981#L536 assume !(main_~length~0#1 < 1); 972#L536-2 assume !(main_~n~1#1 < 1); 973#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~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_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 966#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 967#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 968#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 969#L545-4 main_~i~1#1 := 0; 976#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 977#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 978#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 974#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 975#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 983#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 982#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 979#L528-2 [2021-12-21 22:50:13,970 INFO L793 eck$LassoCheckResult]: Loop: 979#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 980#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 979#L528-2 [2021-12-21 22:50:13,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:13,971 INFO L85 PathProgramCache]: Analyzing trace with hash -718415251, now seen corresponding path program 1 times [2021-12-21 22:50:13,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:13,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911337038] [2021-12-21 22:50:13,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:13,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:14,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:14,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911337038] [2021-12-21 22:50:14,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911337038] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:50:14,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589595376] [2021-12-21 22:50:14,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:14,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:50:14,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:14,024 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:50:14,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-12-21 22:50:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:14,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 22:50:14,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:14,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:50:14,223 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 [2021-12-21 22:50:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:14,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589595376] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:50:14,289 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:50:14,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2021-12-21 22:50:14,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422035463] [2021-12-21 22:50:14,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:50:14,290 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:50:14,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:14,290 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 3 times [2021-12-21 22:50:14,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:14,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341627147] [2021-12-21 22:50:14,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:14,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:14,292 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:14,294 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:14,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:14,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 22:50:14,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-12-21 22:50:14,323 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:50:14,443 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2021-12-21 22:50:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 22:50:14,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2021-12-21 22:50:14,444 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-12-21 22:50:14,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 38 transitions. [2021-12-21 22:50:14,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-12-21 22:50:14,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-12-21 22:50:14,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2021-12-21 22:50:14,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:14,444 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-12-21 22:50:14,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2021-12-21 22:50:14,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2021-12-21 22:50:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-12-21 22:50:14,445 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-21 22:50:14,445 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-21 22:50:14,445 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-21 22:50:14,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2021-12-21 22:50:14,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:50:14,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:14,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:14,446 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:14,446 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:50:14,446 INFO L791 eck$LassoCheckResult]: Stem: 1148#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1149#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~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 1160#L536 assume !(main_~length~0#1 < 1); 1150#L536-2 assume !(main_~n~1#1 < 1); 1151#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~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_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 1144#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 1145#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 1146#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 1147#L545-4 main_~i~1#1 := 0; 1154#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1155#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1156#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1157#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1171#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 1170#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 1169#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 1168#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 1161#L526 assume 0 != cstrlcpy_~siz#1 % 4294967296;call write~int(0, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, 1); 1158#L528-2 [2021-12-21 22:50:14,446 INFO L793 eck$LassoCheckResult]: Loop: 1158#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 1159#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 1158#L528-2 [2021-12-21 22:50:14,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:14,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1571238007, now seen corresponding path program 1 times [2021-12-21 22:50:14,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:14,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994604069] [2021-12-21 22:50:14,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:14,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:14,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:14,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994604069] [2021-12-21 22:50:14,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994604069] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:50:14,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091333494] [2021-12-21 22:50:14,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:14,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:50:14,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:14,519 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:50:14,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2021-12-21 22:50:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:14,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-21 22:50:14,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 22:50:14,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:50:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 22:50:14,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091333494] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-21 22:50:14,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-21 22:50:14,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 11 [2021-12-21 22:50:14,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35621289] [2021-12-21 22:50:14,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:50:14,656 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:50:14,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:14,657 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 4 times [2021-12-21 22:50:14,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:14,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902307023] [2021-12-21 22:50:14,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:14,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:14,659 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:14,660 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:14,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:14,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:50:14,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-21 22:50:14,686 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:50:14,691 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-12-21 22:50:14,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 22:50:14,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2021-12-21 22:50:14,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:50:14,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 24 states and 27 transitions. [2021-12-21 22:50:14,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-21 22:50:14,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-21 22:50:14,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2021-12-21 22:50:14,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:14,692 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-21 22:50:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2021-12-21 22:50:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-12-21 22:50:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-12-21 22:50:14,693 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-21 22:50:14,693 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-21 22:50:14,693 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-21 22:50:14,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2021-12-21 22:50:14,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:50:14,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:14,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:14,694 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:14,694 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:50:14,694 INFO L791 eck$LassoCheckResult]: Stem: 1320#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1321#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~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 1332#L536 assume !(main_~length~0#1 < 1); 1322#L536-2 assume !(main_~n~1#1 < 1); 1323#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~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_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 1316#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 1317#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 1318#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 1319#L545-4 main_~i~1#1 := 0; 1328#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1329#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1330#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1331#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1335#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1339#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1338#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1337#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1336#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 1324#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 1325#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 1334#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 1333#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 1326#L528-2 [2021-12-21 22:50:14,694 INFO L793 eck$LassoCheckResult]: Loop: 1326#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 1327#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 1326#L528-2 [2021-12-21 22:50:14,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:14,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1995057991, now seen corresponding path program 2 times [2021-12-21 22:50:14,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:14,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745246290] [2021-12-21 22:50:14,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:14,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:14,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:14,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745246290] [2021-12-21 22:50:14,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745246290] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:50:14,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392083138] [2021-12-21 22:50:14,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 22:50:14,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:50:14,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:14,779 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:50:14,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2021-12-21 22:50:14,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 22:50:14,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:50:14,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-21 22:50:14,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:14,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:50:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:15,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392083138] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:50:15,150 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:50:15,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2021-12-21 22:50:15,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378993118] [2021-12-21 22:50:15,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:50:15,150 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:50:15,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:15,151 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 5 times [2021-12-21 22:50:15,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:15,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845414674] [2021-12-21 22:50:15,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:15,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:15,153 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:15,155 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:15,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:15,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-21 22:50:15,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2021-12-21 22:50:15,199 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:50:15,481 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2021-12-21 22:50:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-21 22:50:15,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2021-12-21 22:50:15,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:50:15,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 36 states and 39 transitions. [2021-12-21 22:50:15,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-21 22:50:15,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-21 22:50:15,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2021-12-21 22:50:15,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:15,483 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2021-12-21 22:50:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2021-12-21 22:50:15,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-12-21 22:50:15,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:15,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2021-12-21 22:50:15,484 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2021-12-21 22:50:15,484 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2021-12-21 22:50:15,484 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-21 22:50:15,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 39 transitions. [2021-12-21 22:50:15,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:50:15,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:15,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:15,485 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:15,485 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:50:15,485 INFO L791 eck$LassoCheckResult]: Stem: 1567#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1568#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~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 1579#L536 assume !(main_~length~0#1 < 1); 1569#L536-2 assume !(main_~n~1#1 < 1); 1570#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~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_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 1563#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 1564#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 1565#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 1566#L545-4 main_~i~1#1 := 0; 1573#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1574#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1575#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1576#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1582#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1598#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1597#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1596#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1595#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1594#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1593#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1592#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1591#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1590#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1589#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1588#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1587#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1586#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1585#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1584#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1583#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 1571#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 1572#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 1581#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 1580#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 1577#L528-2 [2021-12-21 22:50:15,485 INFO L793 eck$LassoCheckResult]: Loop: 1577#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 1578#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 1577#L528-2 [2021-12-21 22:50:15,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:15,485 INFO L85 PathProgramCache]: Analyzing trace with hash -812594565, now seen corresponding path program 3 times [2021-12-21 22:50:15,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:15,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196016049] [2021-12-21 22:50:15,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:15,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:15,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:15,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196016049] [2021-12-21 22:50:15,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196016049] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:50:15,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097238915] [2021-12-21 22:50:15,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 22:50:15,663 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:50:15,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:15,665 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:50:15,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2021-12-21 22:50:15,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-21 22:50:15,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:50:15,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-21 22:50:15,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:16,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:50:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:16,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097238915] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:50:16,613 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:50:16,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 43 [2021-12-21 22:50:16,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669957150] [2021-12-21 22:50:16,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:50:16,613 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:50:16,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 6 times [2021-12-21 22:50:16,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:16,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985598552] [2021-12-21 22:50:16,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:16,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:16,616 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:16,620 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:16,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:16,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-21 22:50:16,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=1416, Unknown=0, NotChecked=0, Total=1806 [2021-12-21 22:50:16,649 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. cyclomatic complexity: 6 Second operand has 43 states, 43 states have (on average 1.930232558139535) internal successors, (83), 43 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:17,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:50:17,118 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2021-12-21 22:50:17,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-21 22:50:17,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 77 transitions. [2021-12-21 22:50:17,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:50:17,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 60 states and 63 transitions. [2021-12-21 22:50:17,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-21 22:50:17,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-21 22:50:17,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 63 transitions. [2021-12-21 22:50:17,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:17,124 INFO L681 BuchiCegarLoop]: Abstraction has 60 states and 63 transitions. [2021-12-21 22:50:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 63 transitions. [2021-12-21 22:50:17,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-12-21 22:50:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2021-12-21 22:50:17,130 INFO L704 BuchiCegarLoop]: Abstraction has 60 states and 63 transitions. [2021-12-21 22:50:17,130 INFO L587 BuchiCegarLoop]: Abstraction has 60 states and 63 transitions. [2021-12-21 22:50:17,130 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-21 22:50:17,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 63 transitions. [2021-12-21 22:50:17,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:50:17,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:17,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:17,134 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:17,134 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:50:17,135 INFO L791 eck$LassoCheckResult]: Stem: 1939#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1940#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~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 1951#L536 assume !(main_~length~0#1 < 1); 1941#L536-2 assume !(main_~n~1#1 < 1); 1942#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~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_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 1935#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 1936#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 1937#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 1938#L545-4 main_~i~1#1 := 0; 1945#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1946#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1947#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1948#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1954#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1994#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1993#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1992#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1991#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1990#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1989#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1988#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1987#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1986#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1985#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1984#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1983#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1982#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1981#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1980#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1979#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1978#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1977#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1976#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1975#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1974#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1973#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1972#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1971#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1970#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1969#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1968#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1967#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1966#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1965#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1964#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1963#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1962#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1961#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1960#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1959#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1958#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1957#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 1956#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1955#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 1943#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 1944#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 1953#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 1952#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 1949#L528-2 [2021-12-21 22:50:17,135 INFO L793 eck$LassoCheckResult]: Loop: 1949#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 1950#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 1949#L528-2 [2021-12-21 22:50:17,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:17,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1395097315, now seen corresponding path program 4 times [2021-12-21 22:50:17,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:17,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135529358] [2021-12-21 22:50:17,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:17,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:17,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:17,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135529358] [2021-12-21 22:50:17,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135529358] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:50:17,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591173499] [2021-12-21 22:50:17,557 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 22:50:17,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:50:17,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:17,558 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:50:17,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2021-12-21 22:50:17,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 22:50:17,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:50:17,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-21 22:50:17,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:18,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:50:20,156 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:20,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591173499] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:50:20,157 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:50:20,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 80 [2021-12-21 22:50:20,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812723726] [2021-12-21 22:50:20,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:50:20,158 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:50:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:20,158 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 7 times [2021-12-21 22:50:20,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:20,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716155962] [2021-12-21 22:50:20,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:20,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:20,161 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:20,163 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:20,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:20,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-12-21 22:50:20,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1372, Invalid=4948, Unknown=0, NotChecked=0, Total=6320 [2021-12-21 22:50:20,192 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. cyclomatic complexity: 6 Second operand has 80 states, 80 states have (on average 2.1) internal successors, (168), 80 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:22,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:50:22,404 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2021-12-21 22:50:22,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-12-21 22:50:22,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 139 transitions. [2021-12-21 22:50:22,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:50:22,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 108 states and 111 transitions. [2021-12-21 22:50:22,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-21 22:50:22,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-21 22:50:22,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 111 transitions. [2021-12-21 22:50:22,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:50:22,406 INFO L681 BuchiCegarLoop]: Abstraction has 108 states and 111 transitions. [2021-12-21 22:50:22,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 111 transitions. [2021-12-21 22:50:22,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-12-21 22:50:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 107 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:50:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2021-12-21 22:50:22,408 INFO L704 BuchiCegarLoop]: Abstraction has 108 states and 111 transitions. [2021-12-21 22:50:22,408 INFO L587 BuchiCegarLoop]: Abstraction has 108 states and 111 transitions. [2021-12-21 22:50:22,408 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-21 22:50:22,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 111 transitions. [2021-12-21 22:50:22,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:50:22,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:50:22,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:50:22,410 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:50:22,410 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:50:22,410 INFO L791 eck$LassoCheckResult]: Stem: 2638#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2639#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~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 2650#L536 assume !(main_~length~0#1 < 1); 2640#L536-2 assume !(main_~n~1#1 < 1); 2641#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~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_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 2634#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 2635#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 2636#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 2637#L545-4 main_~i~1#1 := 0; 2644#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2645#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2646#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2647#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2653#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2741#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2740#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2739#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2738#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2737#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2736#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2735#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2734#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2733#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2732#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2731#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2730#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2729#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2728#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2727#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2726#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2725#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2724#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2723#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2722#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2721#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2720#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2719#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2718#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2717#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2716#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2715#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2714#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2713#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2712#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2711#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2710#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2709#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2708#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2707#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2706#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2705#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2704#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2703#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2702#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2701#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2700#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2699#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2698#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2697#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2696#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2695#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2694#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2693#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2692#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2691#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2690#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2689#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2688#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2687#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2686#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2685#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2684#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2683#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2682#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2681#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2680#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2679#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2678#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2677#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2676#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2675#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2674#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2673#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2672#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2671#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2670#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2669#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2668#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2667#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2666#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2665#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2664#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2663#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2662#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2661#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2660#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2659#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2658#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2657#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2656#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 2655#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2654#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 2642#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 2643#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 2652#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 2651#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 2648#L528-2 [2021-12-21 22:50:22,410 INFO L793 eck$LassoCheckResult]: Loop: 2648#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 2649#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 2648#L528-2 [2021-12-21 22:50:22,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:22,410 INFO L85 PathProgramCache]: Analyzing trace with hash -297353293, now seen corresponding path program 5 times [2021-12-21 22:50:22,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:22,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727669285] [2021-12-21 22:50:22,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:22,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:50:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:23,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:50:23,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727669285] [2021-12-21 22:50:23,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727669285] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:50:23,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594624650] [2021-12-21 22:50:23,541 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 22:50:23,541 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:50:23,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:50:23,542 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:50:23,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-12-21 22:50:48,941 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2021-12-21 22:50:48,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:50:48,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-21 22:50:48,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:50:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:51,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:50:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:50:55,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594624650] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:50:55,908 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:50:55,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 152 [2021-12-21 22:50:55,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130264729] [2021-12-21 22:50:55,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:50:55,909 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:50:55,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:50:55,910 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 8 times [2021-12-21 22:50:55,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:50:55,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030102854] [2021-12-21 22:50:55,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:50:55,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:50:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:55,913 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:50:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:50:55,919 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:50:55,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:50:55,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2021-12-21 22:50:55,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5019, Invalid=17933, Unknown=0, NotChecked=0, Total=22952 [2021-12-21 22:50:55,950 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. cyclomatic complexity: 6 Second operand has 152 states, 152 states have (on average 2.0526315789473686) internal successors, (312), 152 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:51:03,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:51:03,128 INFO L93 Difference]: Finished difference Result 210 states and 259 transitions. [2021-12-21 22:51:03,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2021-12-21 22:51:03,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 259 transitions. [2021-12-21 22:51:03,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:51:03,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 204 states and 207 transitions. [2021-12-21 22:51:03,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-21 22:51:03,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-21 22:51:03,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 204 states and 207 transitions. [2021-12-21 22:51:03,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:51:03,132 INFO L681 BuchiCegarLoop]: Abstraction has 204 states and 207 transitions. [2021-12-21 22:51:03,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states and 207 transitions. [2021-12-21 22:51:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2021-12-21 22:51:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 204 states have (on average 1.0147058823529411) internal successors, (207), 203 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:51:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 207 transitions. [2021-12-21 22:51:03,140 INFO L704 BuchiCegarLoop]: Abstraction has 204 states and 207 transitions. [2021-12-21 22:51:03,140 INFO L587 BuchiCegarLoop]: Abstraction has 204 states and 207 transitions. [2021-12-21 22:51:03,140 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-21 22:51:03,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 207 transitions. [2021-12-21 22:51:03,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:51:03,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:51:03,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:51:03,142 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:51:03,142 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:51:03,143 INFO L791 eck$LassoCheckResult]: Stem: 3937#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3938#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~nondet15#1, main_#t~post14#1, main_~i~1#1, main_#t~ret16#1, main_~length~0#1, main_~n~1#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~n~1#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 3949#L536 assume !(main_~length~0#1 < 1); 3939#L536-2 assume !(main_~n~1#1 < 1); 3940#L539-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~n~1#1);main_~nondetString1~0#1.base, main_~nondetString1~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_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 3933#L545-3 assume !!(main_~i~0#1 < main_~length~0#1 - 1);call write~int(main_#t~nondet13#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet13#1; 3934#L545-2 main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 3935#L545-3 assume !(main_~i~0#1 < main_~length~0#1 - 1); 3936#L545-4 main_~i~1#1 := 0; 3943#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3944#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3945#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3946#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3952#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4136#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4135#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4134#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4133#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4132#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4131#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4130#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4129#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4128#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4127#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4126#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4125#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4124#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4123#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4122#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4121#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4120#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4119#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4118#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4117#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4116#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4115#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4114#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4113#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4112#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4111#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4110#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4109#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4108#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4107#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4106#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4105#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4104#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4103#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4102#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4101#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4100#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4099#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4098#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4097#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4096#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4095#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4094#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4093#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4092#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4091#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4090#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4089#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4088#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4087#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4086#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4085#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4084#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4083#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4082#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4081#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4080#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4079#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4078#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4077#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4076#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4075#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4074#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4073#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4072#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4071#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4070#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4069#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4068#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4067#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4066#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4065#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4064#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4063#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4062#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4061#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4060#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4059#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4058#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4057#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4056#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4055#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4054#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4053#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4052#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4051#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4050#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4049#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4048#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4047#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4046#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4045#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4044#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4043#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4042#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4041#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4040#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4039#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4038#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4037#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4036#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4035#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4034#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4033#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4032#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4031#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4030#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4029#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4028#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4027#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4026#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4025#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4024#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4023#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4022#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4021#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4020#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4019#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4018#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4017#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4016#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4015#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4014#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4013#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4012#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4011#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4010#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4009#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4008#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4007#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4006#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4005#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4004#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4003#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4002#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 4001#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 4000#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3999#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3998#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3997#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3996#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3995#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3994#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3993#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3992#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3991#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3990#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3989#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3988#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3987#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3986#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3985#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3984#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3983#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3982#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3981#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3980#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3979#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3978#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3977#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3976#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3975#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3974#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3973#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3972#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3971#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3970#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3969#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3968#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3967#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3966#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3965#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3964#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3963#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3962#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3961#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3960#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3959#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3958#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3957#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3956#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3955#L550-3 assume !!(main_~i~1#1 < main_~n~1#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet15#1; 3954#L550-2 main_#t~post14#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 3953#L550-3 assume !(main_~i~1#1 < main_~n~1#1 - 1); 3941#L550-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~n~1#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length~0#1 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset, cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset, cstrlcpy_#in~siz#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~1#1;havoc cstrlcpy_#res#1;havoc cstrlcpy_#t~post3#1.base, cstrlcpy_#t~post3#1.offset, cstrlcpy_#t~post4#1.base, cstrlcpy_#t~post4#1.offset, cstrlcpy_#t~mem5#1, cstrlcpy_#t~pre2#1, cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, cstrlcpy_#t~mem7#1, cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset, cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset, cstrlcpy_~siz#1, cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset, cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset, cstrlcpy_~n~0#1;cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset := cstrlcpy_#in~dst#1.base, cstrlcpy_#in~dst#1.offset;cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset := cstrlcpy_#in~src#1.base, cstrlcpy_#in~src#1.offset;cstrlcpy_~siz#1 := cstrlcpy_#in~siz#1;cstrlcpy_~d~0#1.base, cstrlcpy_~d~0#1.offset := cstrlcpy_~dst#1.base, cstrlcpy_~dst#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_~src#1.base, cstrlcpy_~src#1.offset;cstrlcpy_~n~0#1 := cstrlcpy_~siz#1; 3942#L519 assume !(0 != cstrlcpy_~n~0#1 % 4294967296); 3951#L519-1 assume 0 == cstrlcpy_~n~0#1 % 4294967296; 3950#L526 assume !(0 != cstrlcpy_~siz#1 % 4294967296); 3947#L528-2 [2021-12-21 22:51:03,143 INFO L793 eck$LassoCheckResult]: Loop: 3947#L528-2 cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset := cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset;cstrlcpy_~s~0#1.base, cstrlcpy_~s~0#1.offset := cstrlcpy_#t~post6#1.base, 1 + cstrlcpy_#t~post6#1.offset;call cstrlcpy_#t~mem7#1 := read~int(cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset, 1); 3948#L528 assume !!(0 != cstrlcpy_#t~mem7#1);havoc cstrlcpy_#t~post6#1.base, cstrlcpy_#t~post6#1.offset;havoc cstrlcpy_#t~mem7#1; 3947#L528-2 [2021-12-21 22:51:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:51:03,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1364418221, now seen corresponding path program 6 times [2021-12-21 22:51:03,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:51:03,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763083052] [2021-12-21 22:51:03,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:51:03,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:51:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:51:06,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8837 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:51:06,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:51:06,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763083052] [2021-12-21 22:51:06,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763083052] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:51:06,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146644321] [2021-12-21 22:51:06,730 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-21 22:51:06,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:51:06,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:51:06,732 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:51:06,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process