./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrncmp_mixed_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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/termination-15/cstrncmp_mixed_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8073940322b86f31cbfc905281bb42e15edc78a9ca8cdc6bd61dc1df37f3cf2e --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:05:43,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:05:43,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:05:43,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:05:43,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:05:43,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:05:43,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:05:43,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:05:43,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:05:43,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:05:43,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:05:43,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:05:43,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:05:43,360 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:05:43,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:05:43,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:05:43,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:05:43,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:05:43,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:05:43,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:05:43,379 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:05:43,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:05:43,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:05:43,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:05:43,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:05:43,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:05:43,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:05:43,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:05:43,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:05:43,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:05:43,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:05:43,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:05:43,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:05:43,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:05:43,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:05:43,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:05:43,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:05:43,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:05:43,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:05:43,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:05:43,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:05:43,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:05:43,401 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 15:05:43,423 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:05:43,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:05:43,423 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:05:43,423 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:05:43,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:05:43,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:05:43,425 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:05:43,425 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:05:43,425 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:05:43,425 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:05:43,426 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:05:43,426 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:05:43,426 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:05:43,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:05:43,426 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:05:43,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:05:43,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:05:43,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:05:43,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:05:43,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:05:43,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:05:43,428 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:05:43,428 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:05:43,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:05:43,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:05:43,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:05:43,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:05:43,429 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:05:43,430 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:05:43,430 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8073940322b86f31cbfc905281bb42e15edc78a9ca8cdc6bd61dc1df37f3cf2e [2022-07-14 15:05:43,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:05:43,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:05:43,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:05:43,691 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:05:43,692 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:05:43,693 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncmp_mixed_alloca.i [2022-07-14 15:05:43,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc23e9f2/40ef31fca6a048099fc0ef2288d061f9/FLAG132ae3037 [2022-07-14 15:05:44,157 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:05:44,157 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncmp_mixed_alloca.i [2022-07-14 15:05:44,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc23e9f2/40ef31fca6a048099fc0ef2288d061f9/FLAG132ae3037 [2022-07-14 15:05:44,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc23e9f2/40ef31fca6a048099fc0ef2288d061f9 [2022-07-14 15:05:44,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:05:44,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:05:44,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:05:44,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:05:44,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:05:44,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:05:44" (1/1) ... [2022-07-14 15:05:44,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c4f0d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:05:44, skipping insertion in model container [2022-07-14 15:05:44,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:05:44" (1/1) ... [2022-07-14 15:05:44,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:05:44,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:05:44,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:05:44,871 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:05:44,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:05:44,951 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:05:44,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:05:44 WrapperNode [2022-07-14 15:05:44,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:05:44,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:05:44,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:05:44,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:05:44,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:05:44" (1/1) ... [2022-07-14 15:05:44,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:05:44" (1/1) ... [2022-07-14 15:05:45,007 INFO L137 Inliner]: procedures = 153, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 109 [2022-07-14 15:05:45,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:05:45,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:05:45,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:05:45,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:05:45,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:05:44" (1/1) ... [2022-07-14 15:05:45,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:05:44" (1/1) ... [2022-07-14 15:05:45,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:05:44" (1/1) ... [2022-07-14 15:05:45,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:05:44" (1/1) ... [2022-07-14 15:05:45,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:05:44" (1/1) ... [2022-07-14 15:05:45,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:05:44" (1/1) ... [2022-07-14 15:05:45,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:05:44" (1/1) ... [2022-07-14 15:05:45,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:05:45,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:05:45,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:05:45,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:05:45,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:05:44" (1/1) ... [2022-07-14 15:05:45,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:45,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:45,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:45,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-14 15:05:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 15:05:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:05:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 15:05:45,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 15:05:45,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:05:45,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:05:45,169 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:05:45,170 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:05:45,349 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:05:45,354 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:05:45,355 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 15:05:45,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:05:45 BoogieIcfgContainer [2022-07-14 15:05:45,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:05:45,359 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:05:45,360 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:05:45,365 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:05:45,366 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:05:45,366 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:05:44" (1/3) ... [2022-07-14 15:05:45,367 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17a110bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:05:45, skipping insertion in model container [2022-07-14 15:05:45,368 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:05:45,368 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:05:44" (2/3) ... [2022-07-14 15:05:45,368 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17a110bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:05:45, skipping insertion in model container [2022-07-14 15:05:45,368 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:05:45,369 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:05:45" (3/3) ... [2022-07-14 15:05:45,370 INFO L354 chiAutomizerObserver]: Analyzing ICFG cstrncmp_mixed_alloca.i [2022-07-14 15:05:45,416 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:05:45,416 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:05:45,416 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:05:45,416 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:05:45,416 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:05:45,416 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:05:45,416 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:05:45,417 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:05:45,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:05:45,444 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-14 15:05:45,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:05:45,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:05:45,449 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-14 15:05:45,449 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:05:45,450 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:05:45,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:05:45,453 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-14 15:05:45,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:05:45,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:05:45,454 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-14 15:05:45,454 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:05:45,459 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 3#L383true assume !(main_~length1~0#1 < 1); 11#L383-2true assume !(main_~length2~0#1 < 1); 12#L386-1true call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 24#L391-3true [2022-07-14 15:05:45,459 INFO L754 eck$LassoCheckResult]: Loop: 24#L391-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1; 5#L391-2true main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1; 24#L391-3true [2022-07-14 15:05:45,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:45,465 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-07-14 15:05:45,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:45,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5772275] [2022-07-14 15:05:45,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:45,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:45,555 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:05:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:45,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:05:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:45,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-07-14 15:05:45,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:45,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474636198] [2022-07-14 15:05:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:45,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:45,594 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:05:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:45,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:05:45,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:45,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-07-14 15:05:45,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:45,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259058571] [2022-07-14 15:05:45,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:45,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:45,652 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:05:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:45,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:05:46,018 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:05:46,019 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:05:46,019 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:05:46,019 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:05:46,019 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:05:46,019 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:46,020 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:05:46,020 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:05:46,020 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp_mixed_alloca.i_Iteration1_Lasso [2022-07-14 15:05:46,020 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:05:46,021 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:05:46,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:46,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:46,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:46,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:46,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:46,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:46,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:46,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:46,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:46,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:46,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:46,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:46,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:46,462 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:05:46,471 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:05:46,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:46,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:46,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:46,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-14 15:05:46,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:46,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:46,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:05:46,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:46,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:46,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:46,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:05:46,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:05:46,498 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:46,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:46,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:46,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:46,526 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:46,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-14 15:05:46,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:46,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:46,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:46,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:46,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:46,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:05:46,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:05:46,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:46,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:46,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:46,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:46,583 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:46,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:46,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:46,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:46,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:46,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:46,599 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:05:46,599 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:05:46,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-14 15:05:46,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:46,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:46,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:46,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:46,645 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:46,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:46,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:46,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:05:46,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:46,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:46,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:46,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:05:46,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:05:46,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-14 15:05:46,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:46,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:46,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:46,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:46,697 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:46,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:46,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-14 15:05:46,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:46,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:05:46,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:46,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:46,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:46,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:05:46,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:05:46,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:46,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:46,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:46,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:46,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:46,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-14 15:05:46,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:46,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:46,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:46,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:46,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:46,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:05:46,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:05:46,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:46,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:46,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:46,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:46,810 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:46,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-14 15:05:46,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:46,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:46,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:46,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:46,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:46,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:05:46,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:05:46,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:46,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:46,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:46,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:46,861 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:46,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-14 15:05:46,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:46,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:46,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:46,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:46,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:46,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:05:46,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:05:46,910 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:05:46,966 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-14 15:05:46,966 INFO L444 ModelExtractionUtils]: 5 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-07-14 15:05:46,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:46,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:46,983 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:46,987 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:05:46,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-14 15:05:47,005 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:05:47,005 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:05:47,006 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length1~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-14 15:05:47,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:47,074 INFO L293 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-07-14 15:05:47,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:05:47,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:05:47,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:05:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:05:47,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:05:47,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:05:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:05:47,181 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:05:47,183 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:05:47,226 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 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 91 transitions. Complement of second has 7 states. [2022-07-14 15:05:47,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:05:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:05:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-07-14 15:05:47,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-14 15:05:47,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:05:47,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-14 15:05:47,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:05:47,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-14 15:05:47,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:05:47,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 91 transitions. [2022-07-14 15:05:47,239 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-14 15:05:47,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 18 states and 25 transitions. [2022-07-14 15:05:47,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-14 15:05:47,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-14 15:05:47,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2022-07-14 15:05:47,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:05:47,244 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-07-14 15:05:47,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2022-07-14 15:05:47,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-14 15:05:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:05:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-07-14 15:05:47,262 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-07-14 15:05:47,262 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-07-14 15:05:47,263 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:05:47,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-07-14 15:05:47,263 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-14 15:05:47,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:05:47,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:05:47,264 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:05:47,264 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:05:47,264 INFO L752 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~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 156#L383 assume !(main_~length1~0#1 < 1); 157#L383-2 assume !(main_~length2~0#1 < 1); 169#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 170#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 172#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 162#L396-3 [2022-07-14 15:05:47,264 INFO L754 eck$LassoCheckResult]: Loop: 162#L396-3 assume !!(main_~i~1#1 > 0);call write~int(main_#t~nondet223#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet223#1; 164#L396-2 main_#t~post222#1 := main_~i~1#1;main_~i~1#1 := main_#t~post222#1 - 1;havoc main_#t~post222#1; 162#L396-3 [2022-07-14 15:05:47,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-07-14 15:05:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:47,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332505478] [2022-07-14 15:05:47,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:47,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:47,282 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:05:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:47,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:05:47,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:47,295 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-07-14 15:05:47,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:47,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333327666] [2022-07-14 15:05:47,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:47,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:47,300 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:05:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:47,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:05:47,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:47,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-07-14 15:05:47,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:47,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495234079] [2022-07-14 15:05:47,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:47,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:47,318 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:05:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:47,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:05:47,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:47,701 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:05:47,701 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:05:47,701 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:05:47,701 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:05:47,701 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:05:47,701 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:47,701 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:05:47,701 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:05:47,701 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp_mixed_alloca.i_Iteration2_Lasso [2022-07-14 15:05:47,701 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:05:47,701 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:05:47,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:47,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:47,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:47,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:47,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:47,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:47,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:47,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:47,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:47,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:47,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:47,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:48,128 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:05:48,128 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:05:48,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:48,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:48,130 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:48,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-14 15:05:48,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 [2022-07-14 15:05:48,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:48,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:05:48,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:48,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:48,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:48,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:05:48,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:05:48,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:48,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:48,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:48,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:48,183 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:48,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-14 15:05:48,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:48,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:48,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:05:48,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:48,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:48,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:48,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:05:48,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:05:48,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:48,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:48,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:48,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:48,234 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:48,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:48,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:48,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:05:48,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:48,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:48,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:48,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:05:48,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:05:48,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-14 15:05:48,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:48,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:48,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:48,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:48,297 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:48,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-14 15:05:48,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:48,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:48,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:05:48,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:48,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:48,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:48,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:05:48,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:05:48,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:48,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:48,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:48,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:48,354 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:48,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-14 15:05:48,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:48,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:48,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:05:48,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:48,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:48,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:48,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:05:48,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:05:48,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:48,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-14 15:05:48,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:48,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:48,385 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:48,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-14 15:05:48,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:48,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:48,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:48,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:48,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:48,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:05:48,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:05:48,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:48,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-14 15:05:48,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:48,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:48,443 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:48,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:48,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:48,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:48,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:48,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:48,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:05:48,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:05:48,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-14 15:05:48,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:48,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:48,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:48,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:48,501 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:48,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-14 15:05:48,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:48,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:48,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:48,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:48,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:48,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:05:48,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:05:48,567 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:05:48,583 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-14 15:05:48,583 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-14 15:05:48,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:48,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:48,585 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:48,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-14 15:05:48,627 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:05:48,635 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:05:48,635 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:05:48,635 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2022-07-14 15:05:48,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:48,683 INFO L293 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2022-07-14 15:05:48,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:05:48,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:05:48,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:05:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:05:48,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:05:48,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:05:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:05:48,747 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:05:48,748 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:05:48,762 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 40 transitions. Complement of second has 6 states. [2022-07-14 15:05:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:05:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:05:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-07-14 15:05:48,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-14 15:05:48,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:05:48,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-14 15:05:48,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:05:48,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-14 15:05:48,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:05:48,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 40 transitions. [2022-07-14 15:05:48,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 15:05:48,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 19 states and 27 transitions. [2022-07-14 15:05:48,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-14 15:05:48,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-14 15:05:48,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2022-07-14 15:05:48,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:05:48,774 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-07-14 15:05:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2022-07-14 15:05:48,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-14 15:05:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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) [2022-07-14 15:05:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2022-07-14 15:05:48,776 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-07-14 15:05:48,776 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-07-14 15:05:48,777 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:05:48,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2022-07-14 15:05:48,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 15:05:48,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:05:48,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:05:48,783 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:05:48,783 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:05:48,783 INFO L752 eck$LassoCheckResult]: Stem: 291#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 292#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 287#L383 assume !(main_~length1~0#1 < 1); 288#L383-2 assume !(main_~length2~0#1 < 1); 301#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 302#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 304#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 293#L396-3 assume !(main_~i~1#1 > 0); 294#L396-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 299#L368 assume !(0 == cstrncmp_~n#1); 300#L370-5 [2022-07-14 15:05:48,796 INFO L754 eck$LassoCheckResult]: Loop: 300#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 303#L370-1 assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; 297#L370-3 assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; 298#L371 assume cstrncmp_#t~short210#1; 305#L371-2 assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 300#L370-5 [2022-07-14 15:05:48,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:48,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1595220890, now seen corresponding path program 1 times [2022-07-14 15:05:48,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:48,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874405990] [2022-07-14 15:05:48,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:48,824 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:05:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:48,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:05:48,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:48,842 INFO L85 PathProgramCache]: Analyzing trace with hash 79307716, now seen corresponding path program 1 times [2022-07-14 15:05:48,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:48,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012423082] [2022-07-14 15:05:48,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:48,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:48,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:05:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:05:48,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:05:48,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012423082] [2022-07-14 15:05:48,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012423082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:05:48,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:05:48,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 15:05:48,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245055141] [2022-07-14 15:05:48,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:05:48,886 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:05:48,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:05:48,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:05:48,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:05:48,889 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 11 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:05:48,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:05:48,897 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-07-14 15:05:48,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:05:48,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2022-07-14 15:05:48,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 15:05:48,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 26 transitions. [2022-07-14 15:05:48,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-14 15:05:48,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-14 15:05:48,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-07-14 15:05:48,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:05:48,900 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-14 15:05:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-07-14 15:05:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-14 15:05:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:05:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-07-14 15:05:48,909 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-14 15:05:48,909 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-14 15:05:48,909 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:05:48,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-07-14 15:05:48,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 15:05:48,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:05:48,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:05:48,911 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:05:48,913 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:05:48,913 INFO L752 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 335#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 332#L383 assume !(main_~length1~0#1 < 1); 333#L383-2 assume !(main_~length2~0#1 < 1); 346#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 347#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 349#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 338#L396-3 assume !(main_~i~1#1 > 0); 339#L396-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 344#L368 assume !(0 == cstrncmp_~n#1); 345#L370-5 [2022-07-14 15:05:48,913 INFO L754 eck$LassoCheckResult]: Loop: 345#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 348#L370-1 assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; 342#L370-3 assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; 343#L371 assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1; 350#L371-2 assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 345#L370-5 [2022-07-14 15:05:48,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:48,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1595220890, now seen corresponding path program 2 times [2022-07-14 15:05:48,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:48,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220161626] [2022-07-14 15:05:48,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:48,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:48,946 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:05:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:48,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:05:48,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 1 times [2022-07-14 15:05:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:48,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929146442] [2022-07-14 15:05:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:48,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:48,979 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:05:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:48,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:05:48,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:48,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1988601847, now seen corresponding path program 1 times [2022-07-14 15:05:48,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:48,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026483827] [2022-07-14 15:05:48,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:48,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:05:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:05:49,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:05:49,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026483827] [2022-07-14 15:05:49,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026483827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:05:49,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:05:49,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 15:05:49,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652924287] [2022-07-14 15:05:49,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:05:49,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:05:49,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 15:05:49,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 15:05:49,305 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 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) [2022-07-14 15:05:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:05:49,382 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-07-14 15:05:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 15:05:49,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2022-07-14 15:05:49,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 15:05:49,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2022-07-14 15:05:49,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-14 15:05:49,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-14 15:05:49,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2022-07-14 15:05:49,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:05:49,384 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-14 15:05:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2022-07-14 15:05:49,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-07-14 15:05:49,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:05:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-07-14 15:05:49,386 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-07-14 15:05:49,386 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-07-14 15:05:49,386 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:05:49,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2022-07-14 15:05:49,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 15:05:49,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:05:49,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:05:49,387 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:05:49,387 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:05:49,387 INFO L752 eck$LassoCheckResult]: Stem: 403#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 404#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 401#L383 assume !(main_~length1~0#1 < 1); 402#L383-2 assume !(main_~length2~0#1 < 1); 415#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 416#L391-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1; 405#L391-2 main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1; 406#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 418#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 407#L396-3 assume !(main_~i~1#1 > 0); 408#L396-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 413#L368 assume !(0 == cstrncmp_~n#1); 414#L370-5 [2022-07-14 15:05:49,388 INFO L754 eck$LassoCheckResult]: Loop: 414#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 417#L370-1 assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; 411#L370-3 assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; 412#L371 assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1; 419#L371-2 assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 414#L370-5 [2022-07-14 15:05:49,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:49,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1351083896, now seen corresponding path program 1 times [2022-07-14 15:05:49,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:49,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591374888] [2022-07-14 15:05:49,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:49,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:49,401 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:05:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:49,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:05:49,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:49,411 INFO L85 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 2 times [2022-07-14 15:05:49,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:49,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498298914] [2022-07-14 15:05:49,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:49,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:49,417 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:05:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:49,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:05:49,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:49,422 INFO L85 PathProgramCache]: Analyzing trace with hash -350531861, now seen corresponding path program 1 times [2022-07-14 15:05:49,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:49,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80294164] [2022-07-14 15:05:49,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:49,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:05:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 15:05:49,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:05:49,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80294164] [2022-07-14 15:05:49,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80294164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:05:49,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:05:49,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 15:05:49,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225306622] [2022-07-14 15:05:49,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:05:49,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:05:49,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 15:05:49,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 15:05:49,742 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 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) [2022-07-14 15:05:49,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:05:49,885 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-07-14 15:05:49,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 15:05:49,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2022-07-14 15:05:49,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 15:05:49,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 33 transitions. [2022-07-14 15:05:49,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-07-14 15:05:49,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-07-14 15:05:49,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 33 transitions. [2022-07-14 15:05:49,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:05:49,888 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-07-14 15:05:49,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 33 transitions. [2022-07-14 15:05:49,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-14 15:05:49,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 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) [2022-07-14 15:05:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-07-14 15:05:49,889 INFO L392 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-07-14 15:05:49,889 INFO L374 stractBuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-07-14 15:05:49,890 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 15:05:49,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2022-07-14 15:05:49,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 15:05:49,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:05:49,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:05:49,890 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:05:49,890 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:05:49,891 INFO L752 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 477#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 474#L383 assume !(main_~length1~0#1 < 1); 475#L383-2 assume !(main_~length2~0#1 < 1); 489#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 490#L391-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1; 478#L391-2 main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1; 479#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 492#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 480#L396-3 assume !(main_~i~1#1 > 0); 481#L396-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 496#L368 assume !(0 == cstrncmp_~n#1); 495#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 491#L370-1 assume !cstrncmp_#t~short208#1; 485#L370-3 [2022-07-14 15:05:49,891 INFO L754 eck$LassoCheckResult]: Loop: 485#L370-3 assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; 486#L371 assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1; 493#L371-2 assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 488#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 494#L370-1 assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; 485#L370-3 [2022-07-14 15:05:49,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:49,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1311502365, now seen corresponding path program 1 times [2022-07-14 15:05:49,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:49,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302140070] [2022-07-14 15:05:49,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:49,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:49,911 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:05:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:49,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:05:49,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:49,921 INFO L85 PathProgramCache]: Analyzing trace with hash 89863848, now seen corresponding path program 3 times [2022-07-14 15:05:49,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:49,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679952065] [2022-07-14 15:05:49,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:49,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:49,927 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:05:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:49,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:05:49,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1796409332, now seen corresponding path program 1 times [2022-07-14 15:05:49,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:49,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097599137] [2022-07-14 15:05:49,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:49,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:05:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 15:05:49,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:05:49,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097599137] [2022-07-14 15:05:49,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097599137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:05:49,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:05:49,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:05:49,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49687090] [2022-07-14 15:05:49,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:05:50,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:05:50,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:05:50,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:05:50,168 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:05:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:05:50,173 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-07-14 15:05:50,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:05:50,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2022-07-14 15:05:50,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 15:05:50,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 23 transitions. [2022-07-14 15:05:50,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-14 15:05:50,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-14 15:05:50,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2022-07-14 15:05:50,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:05:50,175 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-14 15:05:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2022-07-14 15:05:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-14 15:05:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:05:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-14 15:05:50,177 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-14 15:05:50,177 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-14 15:05:50,177 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 15:05:50,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2022-07-14 15:05:50,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 15:05:50,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:05:50,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:05:50,178 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:05:50,178 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:05:50,178 INFO L752 eck$LassoCheckResult]: Stem: 531#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 532#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 529#L383 assume !(main_~length1~0#1 < 1); 530#L383-2 assume !(main_~length2~0#1 < 1); 543#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 544#L391-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1; 533#L391-2 main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1; 534#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 546#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 535#L396-3 assume !!(main_~i~1#1 > 0);call write~int(main_#t~nondet223#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet223#1; 536#L396-2 main_#t~post222#1 := main_~i~1#1;main_~i~1#1 := main_#t~post222#1 - 1;havoc main_#t~post222#1; 537#L396-3 assume !(main_~i~1#1 > 0); 538#L396-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 541#L368 assume !(0 == cstrncmp_~n#1); 542#L370-5 [2022-07-14 15:05:50,178 INFO L754 eck$LassoCheckResult]: Loop: 542#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 545#L370-1 assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; 539#L370-3 assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; 540#L371 assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1; 547#L371-2 assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 542#L370-5 [2022-07-14 15:05:50,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:50,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1313217430, now seen corresponding path program 1 times [2022-07-14 15:05:50,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:50,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728818928] [2022-07-14 15:05:50,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:50,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:50,190 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:05:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:50,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:05:50,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:50,206 INFO L85 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 4 times [2022-07-14 15:05:50,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:50,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894125537] [2022-07-14 15:05:50,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:50,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:50,211 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:05:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:50,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:05:50,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:50,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1018233459, now seen corresponding path program 1 times [2022-07-14 15:05:50,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:05:50,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018732228] [2022-07-14 15:05:50,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:05:50,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:05:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:50,230 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:05:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:05:50,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:05:51,304 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:05:51,304 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:05:51,304 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:05:51,304 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:05:51,304 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:05:51,304 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:51,304 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:05:51,304 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:05:51,305 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp_mixed_alloca.i_Iteration7_Lasso [2022-07-14 15:05:51,305 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:05:51,305 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:05:51,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:51,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:05:52,511 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:05:52,511 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:05:52,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:52,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:52,516 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:52,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-14 15:05:52,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:52,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:52,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:05:52,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:52,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:52,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:52,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:05:52,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:05:52,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:52,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:52,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:52,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:52,541 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:52,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-14 15:05:52,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:52,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:52,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:05:52,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:52,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:52,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:52,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:05:52,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:05:52,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:52,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:52,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:52,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:52,570 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:52,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-14 15:05:52,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:52,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:52,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:05:52,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:52,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:52,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:52,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:05:52,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:05:52,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:52,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-14 15:05:52,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:52,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:52,604 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:52,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-14 15:05:52,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:52,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:52,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:52,612 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:05:52,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:52,621 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-14 15:05:52,621 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-14 15:05:52,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:05:52,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-14 15:05:52,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:52,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:52,651 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:52,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-14 15:05:52,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:05:52,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:05:52,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:05:52,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:05:52,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:05:52,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:05:52,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:05:52,699 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:05:52,740 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-07-14 15:05:52,740 INFO L444 ModelExtractionUtils]: 11 out of 52 variables were initially zero. Simplification set additionally 38 variables to zero. [2022-07-14 15:05:52,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:05:52,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:05:52,744 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:05:52,752 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:05:52,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-14 15:05:52,765 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:05:52,765 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:05:52,765 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s2#1.offset) = 2*ULTIMATE.start_cstrncmp_~s2#1.offset + 1 Supporting invariants [] [2022-07-14 15:05:52,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:52,852 INFO L293 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2022-07-14 15:05:52,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:05:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:05:52,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:05:52,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:05:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:05:52,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:05:52,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:05:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:05:52,937 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:05:52,937 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:05:52,949 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 24 states and 29 transitions. Complement of second has 6 states. [2022-07-14 15:05:52,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:05:52,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:05:52,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-07-14 15:05:52,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 14 letters. Loop has 5 letters. [2022-07-14 15:05:52,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:05:52,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 5 letters. [2022-07-14 15:05:52,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:05:52,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 14 letters. Loop has 10 letters. [2022-07-14 15:05:52,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:05:52,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2022-07-14 15:05:52,955 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:05:52,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2022-07-14 15:05:52,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 15:05:52,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 15:05:52,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 15:05:52,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:05:52,955 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:05:52,955 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:05:52,955 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:05:52,955 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 15:05:52,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 15:05:52,955 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:05:52,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 15:05:52,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 03:05:52 BoogieIcfgContainer [2022-07-14 15:05:52,966 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 15:05:52,967 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 15:05:52,967 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 15:05:52,967 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 15:05:52,967 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:05:45" (3/4) ... [2022-07-14 15:05:52,972 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 15:05:52,972 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 15:05:52,973 INFO L158 Benchmark]: Toolchain (without parser) took 8435.50ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 60.6MB in the beginning and 82.9MB in the end (delta: -22.3MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2022-07-14 15:05:52,973 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:05:52,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.25ms. Allocated memory is still 100.7MB. Free memory was 60.4MB in the beginning and 62.2MB in the end (delta: -1.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 15:05:52,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.70ms. Allocated memory is still 100.7MB. Free memory was 62.2MB in the beginning and 60.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:05:52,974 INFO L158 Benchmark]: Boogie Preprocessor took 27.28ms. Allocated memory is still 100.7MB. Free memory was 60.1MB in the beginning and 58.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:05:52,974 INFO L158 Benchmark]: RCFGBuilder took 320.69ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 58.8MB in the beginning and 96.9MB in the end (delta: -38.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2022-07-14 15:05:52,975 INFO L158 Benchmark]: BuchiAutomizer took 7606.99ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 96.9MB in the beginning and 83.9MB in the end (delta: 13.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-07-14 15:05:52,975 INFO L158 Benchmark]: Witness Printer took 5.52ms. Allocated memory is still 146.8MB. Free memory was 83.9MB in the beginning and 82.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:05:52,977 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.25ms. Allocated memory is still 100.7MB. Free memory was 60.4MB in the beginning and 62.2MB in the end (delta: -1.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.70ms. Allocated memory is still 100.7MB. Free memory was 62.2MB in the beginning and 60.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.28ms. Allocated memory is still 100.7MB. Free memory was 60.1MB in the beginning and 58.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 320.69ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 58.8MB in the beginning and 96.9MB in the end (delta: -38.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 7606.99ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 96.9MB in the beginning and 83.9MB in the end (delta: 13.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Witness Printer took 5.52ms. Allocated memory is still 146.8MB. Free memory was 83.9MB in the beginning and 82.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function 2 * s2 + 1 and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 6.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 361 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 223 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 159 IncrementalHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 138 mSDtfsCounter, 159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital182 mio100 ax100 hnf100 lsp90 ukn87 mio100 lsp47 div100 bol100 ite100 ukn100 eq175 hnf90 smp98 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-14 15:05:53,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-14 15:05:53,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE