./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 6c24879c 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-?-6c24879 [2022-07-13 03:24:26,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:24:26,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:24:26,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:24:26,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:24:26,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:24:26,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:24:26,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:24:26,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:24:26,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:24:26,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:24:26,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:24:26,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:24:26,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:24:26,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:24:26,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:24:26,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:24:26,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:24:26,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:24:26,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:24:26,958 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:24:26,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:24:26,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:24:26,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:24:26,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:24:26,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:24:26,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:24:26,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:24:26,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:24:26,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:24:26,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:24:26,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:24:26,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:24:26,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:24:26,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:24:26,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:24:26,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:24:26,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:24:26,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:24:26,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:24:26,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:24:26,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:24:26,974 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-13 03:24:26,991 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:24:26,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:24:26,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:24:26,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:24:26,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:24:26,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:24:26,993 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:24:26,994 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:24:26,994 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:24:26,994 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:24:26,994 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:24:26,994 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:24:26,995 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:24:26,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:24:26,995 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:24:26,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:24:26,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:24:26,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:24:26,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:24:26,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:24:26,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:24:26,997 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:24:26,997 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:24:26,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:24:26,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:24:26,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:24:26,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:24:26,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:24:26,999 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:24:26,999 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-13 03:24:27,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:24:27,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:24:27,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:24:27,242 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:24:27,243 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:24:27,245 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-13 03:24:27,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1826023de/e4441461aa5c4793af125cd45d502e64/FLAGefd47c08e [2022-07-13 03:24:27,807 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:24:27,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncmp_mixed_alloca.i [2022-07-13 03:24:27,819 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1826023de/e4441461aa5c4793af125cd45d502e64/FLAGefd47c08e [2022-07-13 03:24:28,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1826023de/e4441461aa5c4793af125cd45d502e64 [2022-07-13 03:24:28,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:24:28,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:24:28,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:24:28,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:24:28,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:24:28,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:24:28" (1/1) ... [2022-07-13 03:24:28,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55527c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:28, skipping insertion in model container [2022-07-13 03:24:28,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:24:28" (1/1) ... [2022-07-13 03:24:28,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:24:28,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:24:28,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:24:28,625 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:24:28,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:24:28,725 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:24:28,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:28 WrapperNode [2022-07-13 03:24:28,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:24:28,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:24:28,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:24:28,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:24:28,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:28" (1/1) ... [2022-07-13 03:24:28,765 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:28" (1/1) ... [2022-07-13 03:24:28,794 INFO L137 Inliner]: procedures = 153, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 109 [2022-07-13 03:24:28,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:24:28,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:24:28,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:24:28,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:24:28,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:28" (1/1) ... [2022-07-13 03:24:28,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:28" (1/1) ... [2022-07-13 03:24:28,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:28" (1/1) ... [2022-07-13 03:24:28,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:28" (1/1) ... [2022-07-13 03:24:28,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:28" (1/1) ... [2022-07-13 03:24:28,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:28" (1/1) ... [2022-07-13 03:24:28,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:28" (1/1) ... [2022-07-13 03:24:28,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:24:28,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:24:28,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:24:28,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:24:28,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:28" (1/1) ... [2022-07-13 03:24:28,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:28,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:28,874 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-13 03:24:28,883 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-13 03:24:28,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:24:28,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:24:28,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 03:24:28,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:24:28,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:24:28,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:24:28,966 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:24:28,967 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:24:29,099 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:24:29,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:24:29,105 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 03:24:29,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:24:29 BoogieIcfgContainer [2022-07-13 03:24:29,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:24:29,107 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:24:29,108 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:24:29,110 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:24:29,111 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:24:29,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:24:28" (1/3) ... [2022-07-13 03:24:29,112 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7368fc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:24:29, skipping insertion in model container [2022-07-13 03:24:29,112 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:24:29,113 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:28" (2/3) ... [2022-07-13 03:24:29,113 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7368fc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:24:29, skipping insertion in model container [2022-07-13 03:24:29,113 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:24:29,113 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:24:29" (3/3) ... [2022-07-13 03:24:29,114 INFO L354 chiAutomizerObserver]: Analyzing ICFG cstrncmp_mixed_alloca.i [2022-07-13 03:24:29,162 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:24:29,163 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:24:29,163 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:24:29,163 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:24:29,163 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:24:29,163 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:24:29,164 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:24:29,164 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:24:29,167 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-13 03:24:29,184 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-13 03:24:29,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:29,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:29,189 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 03:24:29,190 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:24:29,190 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:24:29,190 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-13 03:24:29,193 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-13 03:24:29,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:29,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:29,194 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 03:24:29,194 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:24:29,200 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-13 03:24:29,200 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-13 03:24:29,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:29,206 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-07-13 03:24:29,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:29,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866051735] [2022-07-13 03:24:29,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:29,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:29,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:29,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:29,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:29,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-07-13 03:24:29,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:29,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104828997] [2022-07-13 03:24:29,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:29,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:29,455 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:29,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:29,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-07-13 03:24:29,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:29,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920243293] [2022-07-13 03:24:29,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:29,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:29,541 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:29,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:29,924 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:24:29,925 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:24:29,925 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:24:29,925 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:24:29,925 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:24:29,926 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:29,926 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:24:29,926 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:24:29,926 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp_mixed_alloca.i_Iteration1_Lasso [2022-07-13 03:24:29,926 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:24:29,926 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:24:29,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-13 03:24:29,948 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-13 03:24:30,095 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-13 03:24:30,098 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-13 03:24:30,101 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-13 03:24:30,105 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-13 03:24:30,108 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-13 03:24:30,110 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-13 03:24:30,112 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-13 03:24:30,114 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-13 03:24:30,117 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-13 03:24:30,119 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-13 03:24:30,121 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-13 03:24:30,352 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:24:30,355 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:24:30,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:30,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:30,359 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-13 03:24:30,360 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-13 03:24:30,362 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-13 03:24:30,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:30,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:30,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:30,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:30,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:30,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:30,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:30,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:30,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-13 03:24:30,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:30,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:30,410 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-13 03:24:30,411 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-13 03:24:30,413 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-13 03:24:30,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:30,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:30,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:30,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:30,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:30,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:30,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:30,474 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-13 03:24:30,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:30,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:30,476 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-13 03:24:30,482 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-13 03:24:30,487 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-13 03:24:30,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:30,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:30,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:30,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:30,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:30,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:30,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:30,517 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-13 03:24:30,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:30,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:30,519 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-13 03:24:30,526 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-13 03:24:30,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:30,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:30,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:30,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:30,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:30,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:30,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:30,537 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-13 03:24:30,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:30,560 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-13 03:24:30,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:30,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:30,562 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-13 03:24:30,562 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-13 03:24:30,564 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-13 03:24:30,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:30,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:30,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:30,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:30,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:30,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:30,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:30,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:30,595 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-13 03:24:30,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:30,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:30,597 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-13 03:24:30,597 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-13 03:24:30,600 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-13 03:24:30,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:30,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:30,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:30,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:30,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:30,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:30,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:30,647 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-13 03:24:30,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:30,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:30,649 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-13 03:24:30,650 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-13 03:24:30,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-13 03:24:30,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:30,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:30,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:30,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:30,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:30,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:30,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:30,695 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-13 03:24:30,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:30,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:30,696 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-13 03:24:30,697 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-13 03:24:30,698 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-13 03:24:30,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:30,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:30,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:30,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:30,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:30,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:30,739 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:24:30,767 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-13 03:24:30,768 INFO L444 ModelExtractionUtils]: 5 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-07-13 03:24:30,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:30,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:30,779 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-13 03:24:30,816 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:24:30,831 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-13 03:24:30,852 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:24:30,853 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:24:30,853 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-13 03:24:30,879 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-13 03:24:30,894 INFO L293 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-07-13 03:24:30,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:30,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:24:30,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:30,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:24:30,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:31,006 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-13 03:24:31,045 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-13 03:24:31,046 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-13 03:24:31,087 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-13 03:24:31,089 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-13 03:24:31,093 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-13 03:24:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-07-13 03:24:31,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-13 03:24:31,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:31,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-13 03:24:31,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:31,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-13 03:24:31,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:31,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 91 transitions. [2022-07-13 03:24:31,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-13 03:24:31,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 18 states and 25 transitions. [2022-07-13 03:24:31,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-13 03:24:31,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-13 03:24:31,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2022-07-13 03:24:31,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:24:31,106 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-07-13 03:24:31,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2022-07-13 03:24:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-13 03:24:31,124 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-13 03:24:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-07-13 03:24:31,125 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-07-13 03:24:31,125 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-07-13 03:24:31,125 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:24:31,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-07-13 03:24:31,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-13 03:24:31,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:31,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:31,127 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:31,127 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:24:31,127 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-13 03:24:31,127 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-13 03:24:31,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:31,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-07-13 03:24:31,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:31,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865232481] [2022-07-13 03:24:31,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:31,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:31,146 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:31,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:31,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:31,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-07-13 03:24:31,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:31,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135762663] [2022-07-13 03:24:31,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:31,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:31,181 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:31,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:31,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:31,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-07-13 03:24:31,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:31,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896246007] [2022-07-13 03:24:31,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:31,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:31,245 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:31,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:31,264 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-13 03:24:31,583 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:24:31,583 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:24:31,583 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:24:31,583 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:24:31,583 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:24:31,583 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:31,583 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:24:31,584 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:24:31,584 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp_mixed_alloca.i_Iteration2_Lasso [2022-07-13 03:24:31,584 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:24:31,584 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:24:31,588 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-13 03:24:31,590 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-13 03:24:31,592 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-13 03:24:31,594 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-13 03:24:31,595 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-13 03:24:31,597 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-13 03:24:31,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:31,777 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-13 03:24:31,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:31,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:31,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:31,790 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-13 03:24:32,008 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:24:32,008 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:24:32,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:32,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:32,012 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-13 03:24:32,015 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-13 03:24:32,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:32,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:32,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:32,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:32,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:32,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:32,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:32,024 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-13 03:24:32,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:32,060 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-13 03:24:32,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:32,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:32,062 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-13 03:24:32,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:32,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:32,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:32,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:32,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:32,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:32,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:32,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:32,080 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-13 03:24:32,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:32,121 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-13 03:24:32,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:32,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:32,123 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-13 03:24:32,124 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-13 03:24:32,127 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-13 03:24:32,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:32,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:32,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:32,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:32,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:32,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:32,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:32,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:32,175 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-13 03:24:32,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:32,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:32,177 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-13 03:24:32,180 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-13 03:24:32,180 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-13 03:24:32,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:32,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:32,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:32,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:32,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:32,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:32,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:32,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:32,224 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-13 03:24:32,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:32,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:32,229 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-13 03:24:32,238 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-13 03:24:32,239 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-13 03:24:32,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:32,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:32,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:32,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:32,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:32,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:32,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:32,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:32,270 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-13 03:24:32,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:32,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:32,272 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-13 03:24:32,272 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-13 03:24:32,274 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-13 03:24:32,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:32,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:32,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:32,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:32,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:32,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:32,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:32,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-13 03:24:32,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:32,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:32,323 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-13 03:24:32,327 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-13 03:24:32,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:24:32,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:32,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:32,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:32,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:32,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:32,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:32,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:32,375 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-13 03:24:32,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:32,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:32,379 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-13 03:24:32,387 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-13 03:24:32,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:32,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:32,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:32,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:32,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:32,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:32,415 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-13 03:24:32,423 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:24:32,446 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-13 03:24:32,446 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-13 03:24:32,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:32,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:32,448 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-13 03:24:32,452 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-13 03:24:32,453 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:24:32,480 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:24:32,480 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:24:32,480 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-13 03:24:32,505 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-13 03:24:32,520 INFO L293 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2022-07-13 03:24:32,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:32,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:24:32,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:32,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:24:32,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:32,580 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-13 03:24:32,581 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-13 03:24:32,581 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-13 03:24:32,598 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-13 03:24:32,599 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-13 03:24:32,600 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-13 03:24:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-07-13 03:24:32,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-13 03:24:32,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:32,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-13 03:24:32,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:32,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-13 03:24:32,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:32,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 40 transitions. [2022-07-13 03:24:32,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:24:32,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 19 states and 27 transitions. [2022-07-13 03:24:32,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-13 03:24:32,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-13 03:24:32,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2022-07-13 03:24:32,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:24:32,604 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-07-13 03:24:32,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2022-07-13 03:24:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-13 03:24:32,605 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-13 03:24:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2022-07-13 03:24:32,606 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-07-13 03:24:32,606 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-07-13 03:24:32,606 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:24:32,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2022-07-13 03:24:32,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:24:32,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:32,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:32,608 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:32,608 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-13 03:24:32,608 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-13 03:24:32,608 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-13 03:24:32,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:32,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1595220890, now seen corresponding path program 1 times [2022-07-13 03:24:32,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:32,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488281053] [2022-07-13 03:24:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:32,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:32,640 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:32,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:32,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash 79307716, now seen corresponding path program 1 times [2022-07-13 03:24:32,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:32,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794517861] [2022-07-13 03:24:32,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:32,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:32,693 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-13 03:24:32,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:24:32,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794517861] [2022-07-13 03:24:32,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794517861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:24:32,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:24:32,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 03:24:32,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704866630] [2022-07-13 03:24:32,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:24:32,696 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:24:32,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:24:32,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:24:32,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:24:32,699 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-13 03:24:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:24:32,706 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-07-13 03:24:32,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:24:32,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2022-07-13 03:24:32,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:24:32,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 26 transitions. [2022-07-13 03:24:32,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-13 03:24:32,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-13 03:24:32,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-07-13 03:24:32,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:24:32,709 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-13 03:24:32,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-07-13 03:24:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-13 03:24:32,710 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-13 03:24:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-07-13 03:24:32,711 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-13 03:24:32,711 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-13 03:24:32,711 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:24:32,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-07-13 03:24:32,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:24:32,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:32,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:32,712 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:32,712 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-13 03:24:32,712 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-13 03:24:32,712 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-13 03:24:32,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:32,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1595220890, now seen corresponding path program 2 times [2022-07-13 03:24:32,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:32,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530151112] [2022-07-13 03:24:32,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:32,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:32,745 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:32,752 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-13 03:24:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:32,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:32,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:32,763 INFO L85 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 1 times [2022-07-13 03:24:32,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:32,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506667167] [2022-07-13 03:24:32,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:32,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:32,770 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:32,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:32,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:32,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1988601847, now seen corresponding path program 1 times [2022-07-13 03:24:32,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:32,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230173726] [2022-07-13 03:24:32,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:32,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:32,940 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-13 03:24:32,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:24:32,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230173726] [2022-07-13 03:24:32,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230173726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:24:32,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:24:32,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 03:24:32,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279372716] [2022-07-13 03:24:32,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:24:33,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:24:33,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 03:24:33,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 03:24:33,127 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-13 03:24:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:24:33,224 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-07-13 03:24:33,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 03:24:33,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2022-07-13 03:24:33,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:24:33,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2022-07-13 03:24:33,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-13 03:24:33,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-13 03:24:33,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2022-07-13 03:24:33,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:24:33,227 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-13 03:24:33,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2022-07-13 03:24:33,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-07-13 03:24:33,229 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-13 03:24:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-07-13 03:24:33,229 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-07-13 03:24:33,229 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-07-13 03:24:33,229 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:24:33,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2022-07-13 03:24:33,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:24:33,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:33,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:33,230 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:33,230 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-13 03:24:33,231 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-13 03:24:33,231 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-13 03:24:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1351083896, now seen corresponding path program 1 times [2022-07-13 03:24:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:33,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398132096] [2022-07-13 03:24:33,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:33,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:33,264 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:33,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:33,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:33,291 INFO L85 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 2 times [2022-07-13 03:24:33,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:33,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803990391] [2022-07-13 03:24:33,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:33,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:33,296 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:33,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:33,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:33,301 INFO L85 PathProgramCache]: Analyzing trace with hash -350531861, now seen corresponding path program 1 times [2022-07-13 03:24:33,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:33,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385638187] [2022-07-13 03:24:33,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:33,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:33,455 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-13 03:24:33,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:24:33,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385638187] [2022-07-13 03:24:33,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385638187] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:24:33,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:24:33,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 03:24:33,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723830423] [2022-07-13 03:24:33,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:24:33,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:24:33,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 03:24:33,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 03:24:33,651 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-13 03:24:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:24:33,793 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-07-13 03:24:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 03:24:33,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2022-07-13 03:24:33,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:24:33,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 33 transitions. [2022-07-13 03:24:33,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-07-13 03:24:33,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-07-13 03:24:33,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 33 transitions. [2022-07-13 03:24:33,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:24:33,796 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-07-13 03:24:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 33 transitions. [2022-07-13 03:24:33,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-13 03:24:33,798 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-13 03:24:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-07-13 03:24:33,798 INFO L392 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-07-13 03:24:33,798 INFO L374 stractBuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-07-13 03:24:33,798 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:24:33,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2022-07-13 03:24:33,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:24:33,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:33,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:33,799 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:33,799 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-13 03:24:33,799 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-13 03:24:33,800 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-13 03:24:33,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:33,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1311502365, now seen corresponding path program 1 times [2022-07-13 03:24:33,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:33,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250335953] [2022-07-13 03:24:33,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:33,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:33,820 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:33,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:33,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:33,838 INFO L85 PathProgramCache]: Analyzing trace with hash 89863848, now seen corresponding path program 3 times [2022-07-13 03:24:33,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:33,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170502641] [2022-07-13 03:24:33,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:33,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:33,850 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:33,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:33,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:33,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1796409332, now seen corresponding path program 1 times [2022-07-13 03:24:33,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:33,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588134287] [2022-07-13 03:24:33,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:33,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:33,898 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-13 03:24:33,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:24:33,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588134287] [2022-07-13 03:24:33,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588134287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:24:33,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:24:33,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:24:33,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626817684] [2022-07-13 03:24:33,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:24:34,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:24:34,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:24:34,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:24:34,141 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-13 03:24:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:24:34,147 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-07-13 03:24:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:24:34,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2022-07-13 03:24:34,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:24:34,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 23 transitions. [2022-07-13 03:24:34,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-13 03:24:34,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-13 03:24:34,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2022-07-13 03:24:34,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:24:34,152 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-13 03:24:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2022-07-13 03:24:34,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-13 03:24:34,154 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-13 03:24:34,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-13 03:24:34,155 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-13 03:24:34,155 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-13 03:24:34,155 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:24:34,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2022-07-13 03:24:34,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:24:34,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:34,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:34,156 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:34,156 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-13 03:24:34,156 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-13 03:24:34,156 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-13 03:24:34,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:34,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1313217430, now seen corresponding path program 1 times [2022-07-13 03:24:34,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:34,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731477469] [2022-07-13 03:24:34,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:34,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:34,169 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:34,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:34,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:34,180 INFO L85 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 4 times [2022-07-13 03:24:34,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:34,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167258794] [2022-07-13 03:24:34,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:34,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:34,185 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:34,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:34,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:34,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1018233459, now seen corresponding path program 1 times [2022-07-13 03:24:34,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:34,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304563948] [2022-07-13 03:24:34,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:34,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:34,205 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:34,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:35,252 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:24:35,252 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:24:35,252 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:24:35,252 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:24:35,252 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:24:35,253 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:35,253 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:24:35,253 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:24:35,253 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp_mixed_alloca.i_Iteration7_Lasso [2022-07-13 03:24:35,253 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:24:35,253 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:24:35,256 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-13 03:24:35,260 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-13 03:24:35,262 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-13 03:24:35,264 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-13 03:24:35,886 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-13 03:24:35,887 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-13 03:24:35,889 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-13 03:24:35,890 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-13 03:24:35,892 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-13 03:24:35,893 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-13 03:24:35,895 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-13 03:24:35,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:35,900 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-13 03:24:35,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-13 03:24:35,903 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-13 03:24:35,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-13 03:24:35,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-13 03:24:35,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-13 03:24:35,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:35,913 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-13 03:24:35,920 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-13 03:24:35,923 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-13 03:24:35,925 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-13 03:24:35,926 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-13 03:24:35,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-13 03:24:35,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:35,930 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-13 03:24:35,932 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-13 03:24:35,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:24:36,441 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:24:36,442 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:24:36,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:36,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:36,448 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-13 03:24:36,451 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-13 03:24:36,451 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-13 03:24:36,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:36,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:36,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:36,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:36,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:36,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:36,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:36,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:36,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-13 03:24:36,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:36,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:36,484 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-13 03:24:36,487 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-13 03:24:36,488 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-13 03:24:36,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:36,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:36,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:36,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:36,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:36,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:36,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:36,504 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:36,521 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-13 03:24:36,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:36,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:36,522 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-13 03:24:36,523 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-13 03:24:36,524 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-13 03:24:36,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:36,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:24:36,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:36,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:36,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:36,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:24:36,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:24:36,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:36,548 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-13 03:24:36,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:36,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:36,551 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-13 03:24:36,552 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-13 03:24:36,553 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-13 03:24:36,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:36,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:36,559 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 03:24:36,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:36,568 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-13 03:24:36,568 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-13 03:24:36,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:24:36,596 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-13 03:24:36,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:36,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:36,599 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-13 03:24:36,600 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-13 03:24:36,601 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-13 03:24:36,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:24:36,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:24:36,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:24:36,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:24:36,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:24:36,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:24:36,659 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:24:36,701 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-07-13 03:24:36,701 INFO L444 ModelExtractionUtils]: 11 out of 52 variables were initially zero. Simplification set additionally 38 variables to zero. [2022-07-13 03:24:36,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:36,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:36,703 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-13 03:24:36,704 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-13 03:24:36,705 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:24:36,712 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:24:36,712 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:24:36,712 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-13 03:24:36,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-13 03:24:36,818 INFO L293 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2022-07-13 03:24:36,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:36,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:24:36,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:24:36,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:24:36,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:24:36,903 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-13 03:24:36,904 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-13 03:24:36,904 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-13 03:24:36,912 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-13 03:24:36,913 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-13 03:24:36,913 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-13 03:24:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-07-13 03:24:36,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 14 letters. Loop has 5 letters. [2022-07-13 03:24:36,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:36,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 5 letters. [2022-07-13 03:24:36,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:36,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 14 letters. Loop has 10 letters. [2022-07-13 03:24:36,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:24:36,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2022-07-13 03:24:36,915 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 03:24:36,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2022-07-13 03:24:36,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-13 03:24:36,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-13 03:24:36,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-13 03:24:36,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:24:36,915 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:24:36,915 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:24:36,915 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:24:36,916 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 03:24:36,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-13 03:24:36,916 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 03:24:36,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-13 03:24:36,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 03:24:36 BoogieIcfgContainer [2022-07-13 03:24:36,921 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 03:24:36,922 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 03:24:36,922 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 03:24:36,922 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 03:24:36,922 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:24:29" (3/4) ... [2022-07-13 03:24:36,925 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 03:24:36,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 03:24:36,925 INFO L158 Benchmark]: Toolchain (without parser) took 8632.14ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 44.3MB in the beginning and 41.8MB in the end (delta: 2.5MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2022-07-13 03:24:36,925 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 79.7MB. Free memory was 52.4MB in the beginning and 52.4MB in the end (delta: 18.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:24:36,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.09ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 44.1MB in the beginning and 63.8MB in the end (delta: -19.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 03:24:36,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.49ms. Allocated memory is still 96.5MB. Free memory was 63.8MB in the beginning and 61.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:24:36,926 INFO L158 Benchmark]: Boogie Preprocessor took 49.29ms. Allocated memory is still 96.5MB. Free memory was 61.7MB in the beginning and 60.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:24:36,926 INFO L158 Benchmark]: RCFGBuilder took 260.97ms. Allocated memory is still 96.5MB. Free memory was 60.5MB in the beginning and 48.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 03:24:36,927 INFO L158 Benchmark]: BuchiAutomizer took 7813.91ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 48.1MB in the beginning and 42.8MB in the end (delta: 5.3MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2022-07-13 03:24:36,927 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 117.4MB. Free memory was 42.8MB in the beginning and 41.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:24:36,928 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.23ms. Allocated memory is still 79.7MB. Free memory was 52.4MB in the beginning and 52.4MB in the end (delta: 18.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.09ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 44.1MB in the beginning and 63.8MB in the end (delta: -19.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.49ms. Allocated memory is still 96.5MB. Free memory was 63.8MB in the beginning and 61.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.29ms. Allocated memory is still 96.5MB. Free memory was 61.7MB in the beginning and 60.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 260.97ms. Allocated memory is still 96.5MB. Free memory was 60.5MB in the beginning and 48.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 7813.91ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 48.1MB in the beginning and 42.8MB in the end (delta: 5.3MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 117.4MB. Free memory was 42.8MB in the beginning and 41.8MB 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.7s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 7.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. 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: 29ms 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-13 03:24:36,960 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-13 03:24:37,167 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