./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/cstrpbrk-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f4570e8b350d1c6ecce62e4659f1c324ac9794563382f5f25c3525057748138 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:53:24,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:53:24,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:53:24,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:53:24,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:53:24,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:53:24,927 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:53:24,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:53:24,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:53:24,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:53:24,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:53:24,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:53:24,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:53:24,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:53:24,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:53:24,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:53:24,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:53:24,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:53:24,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:53:24,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:53:24,951 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:53:24,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:53:24,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:53:24,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:53:24,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:53:24,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:53:24,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:53:24,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:53:24,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:53:24,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:53:24,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:53:24,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:53:24,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:53:24,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:53:24,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:53:24,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:53:24,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:53:24,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:53:24,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:53:24,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:53:24,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:53:24,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:53:24,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:53:24,981 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:53:24,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:53:24,982 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:53:24,982 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:53:24,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:53:24,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:53:24,984 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:53:24,984 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:53:24,984 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:53:24,984 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:53:24,985 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:53:24,985 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:53:24,985 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:53:24,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:53:24,985 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:53:24,985 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:53:24,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:53:24,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:53:24,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:53:24,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:53:24,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:53:24,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:53:24,986 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:53:24,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:53:24,987 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:53:24,987 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:53:24,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:53:24,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:53:24,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:53:24,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:53:24,988 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:53:24,989 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:53:24,989 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f4570e8b350d1c6ecce62e4659f1c324ac9794563382f5f25c3525057748138 [2022-07-13 04:53:25,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:53:25,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:53:25,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:53:25,221 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:53:25,222 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:53:25,223 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2022-07-13 04:53:25,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c68df7f1d/3e3e58082b854e41bc5382b0d303e7b3/FLAG673466844 [2022-07-13 04:53:25,668 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:53:25,676 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2022-07-13 04:53:25,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c68df7f1d/3e3e58082b854e41bc5382b0d303e7b3/FLAG673466844 [2022-07-13 04:53:25,694 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c68df7f1d/3e3e58082b854e41bc5382b0d303e7b3 [2022-07-13 04:53:25,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:53:25,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:53:25,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:53:25,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:53:25,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:53:25,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:53:25" (1/1) ... [2022-07-13 04:53:25,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f32b7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:25, skipping insertion in model container [2022-07-13 04:53:25,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:53:25" (1/1) ... [2022-07-13 04:53:25,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:53:25,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:53:25,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:53:25,950 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:53:25,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:53:25,996 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:53:25,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:25 WrapperNode [2022-07-13 04:53:25,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:53:25,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:53:25,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:53:25,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:53:26,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:25" (1/1) ... [2022-07-13 04:53:26,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:25" (1/1) ... [2022-07-13 04:53:26,050 INFO L137 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2022-07-13 04:53:26,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:53:26,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:53:26,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:53:26,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:53:26,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:25" (1/1) ... [2022-07-13 04:53:26,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:25" (1/1) ... [2022-07-13 04:53:26,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:25" (1/1) ... [2022-07-13 04:53:26,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:25" (1/1) ... [2022-07-13 04:53:26,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:25" (1/1) ... [2022-07-13 04:53:26,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:25" (1/1) ... [2022-07-13 04:53:26,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:25" (1/1) ... [2022-07-13 04:53:26,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:53:26,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:53:26,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:53:26,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:53:26,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:25" (1/1) ... [2022-07-13 04:53:26,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:26,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:26,125 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 04:53:26,127 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 04:53:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 04:53:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 04:53:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 04:53:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 04:53:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:53:26,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:53:26,244 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:53:26,248 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:53:26,406 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:53:26,410 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:53:26,410 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 04:53:26,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:53:26 BoogieIcfgContainer [2022-07-13 04:53:26,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:53:26,412 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:53:26,413 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:53:26,415 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:53:26,416 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:53:26,416 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:53:25" (1/3) ... [2022-07-13 04:53:26,417 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b5ba3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:53:26, skipping insertion in model container [2022-07-13 04:53:26,417 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:53:26,417 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:25" (2/3) ... [2022-07-13 04:53:26,417 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b5ba3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:53:26, skipping insertion in model container [2022-07-13 04:53:26,417 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:53:26,417 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:53:26" (3/3) ... [2022-07-13 04:53:26,418 INFO L354 chiAutomizerObserver]: Analyzing ICFG cstrpbrk-alloca-2.i [2022-07-13 04:53:26,459 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:53:26,460 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:53:26,460 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:53:26,460 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:53:26,460 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:53:26,460 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:53:26,460 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:53:26,461 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:53:26,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 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 04:53:26,479 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-07-13 04:53:26,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:26,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:26,485 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 04:53:26,485 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:53:26,485 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:53:26,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 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 04:53:26,488 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-07-13 04:53:26,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:26,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:26,488 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 04:53:26,489 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:53:26,505 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; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 10#L532true assume !(main_~length1~0#1 < 1); 5#L532-2true assume !(main_~length2~0#1 < 1); 2#L535-1true call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 18#L541-3true [2022-07-13 04:53:26,505 INFO L754 eck$LassoCheckResult]: Loop: 18#L541-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 23#L541-2true main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 18#L541-3true [2022-07-13 04:53:26,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:26,510 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-07-13 04:53:26,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:26,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483041285] [2022-07-13 04:53:26,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:26,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:26,629 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:26,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:26,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:26,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-07-13 04:53:26,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:26,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076704751] [2022-07-13 04:53:26,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:26,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:26,736 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:26,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:26,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:26,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-07-13 04:53:26,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:26,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658474590] [2022-07-13 04:53:26,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:26,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:26,773 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:26,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:27,152 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:53:27,152 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:53:27,153 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:53:27,153 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:53:27,153 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:53:27,153 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:27,153 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:53:27,153 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:53:27,154 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration1_Lasso [2022-07-13 04:53:27,154 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:53:27,154 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:53:27,171 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 04:53:27,341 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 04:53:27,343 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 04:53:27,344 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 04:53:27,350 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 04:53:27,352 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 04:53:27,356 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 04:53:27,358 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 04:53:27,360 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 04:53:27,362 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 04:53:27,365 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 04:53:27,367 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 04:53:27,370 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 04:53:27,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:27,375 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 04:53:27,378 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 04:53:27,618 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:53:27,621 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:53:27,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:27,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:27,623 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 04:53:27,624 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 04:53:27,626 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 04:53:27,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:27,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:27,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:27,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:27,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:27,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:27,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:27,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:27,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:27,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:27,684 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 04:53:27,685 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 04:53:27,686 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 04:53:27,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:27,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:27,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:27,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:27,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:27,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:27,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:27,722 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 04:53:27,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:27,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:27,724 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 04:53:27,725 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 04:53:27,726 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 04:53:27,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:27,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:27,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:27,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:27,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:27,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:27,753 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:53:27,786 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-13 04:53:27,786 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-13 04:53:27,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:27,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:27,789 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 04:53:27,818 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:53:27,826 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 04:53:27,836 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-13 04:53:27,836 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:53:27,837 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~nondetString1~0#1.offset >= 0] [2022-07-13 04:53:27,855 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 04:53:27,880 INFO L293 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2022-07-13 04:53:27,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:27,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:53:27,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:27,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 04:53:27,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:27,965 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 04:53:27,986 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 04:53:27,987 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 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 04:53:28,056 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 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 87 transitions. Complement of second has 7 states. [2022-07-13 04:53:28,057 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 04:53:28,063 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 04:53:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-07-13 04:53:28,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-13 04:53:28,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:28,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-13 04:53:28,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:28,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-13 04:53:28,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:28,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. [2022-07-13 04:53:28,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-13 04:53:28,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 27 transitions. [2022-07-13 04:53:28,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-13 04:53:28,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-13 04:53:28,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2022-07-13 04:53:28,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:28,072 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-13 04:53:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2022-07-13 04:53:28,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 04:53:28,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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 04:53:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-07-13 04:53:28,088 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-13 04:53:28,088 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-13 04:53:28,110 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:53:28,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2022-07-13 04:53:28,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-13 04:53:28,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:28,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:28,111 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:28,111 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:53:28,112 INFO L752 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 168#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 175#L532 assume !(main_~length1~0#1 < 1); 169#L532-2 assume !(main_~length2~0#1 < 1); 165#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 166#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 176#L541-4 main_~i~1#1 := 0; 172#L546-3 [2022-07-13 04:53:28,112 INFO L754 eck$LassoCheckResult]: Loop: 172#L546-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 174#L546-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 172#L546-3 [2022-07-13 04:53:28,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:28,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-07-13 04:53:28,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:28,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751095951] [2022-07-13 04:53:28,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:28,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:28,121 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:28,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:28,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:28,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-07-13 04:53:28,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:28,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061839185] [2022-07-13 04:53:28,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:28,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:28,135 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:28,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:28,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:28,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-07-13 04:53:28,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:28,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994767933] [2022-07-13 04:53:28,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:28,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:28,141 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 04:53:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:28,165 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:28,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:28,378 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:53:28,378 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:53:28,378 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:53:28,378 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:53:28,379 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:53:28,379 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:28,379 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:53:28,379 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:53:28,379 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration2_Lasso [2022-07-13 04:53:28,379 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:53:28,379 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:53:28,380 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 04:53:28,383 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 04:53:28,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:28,387 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 04:53:28,389 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 04:53:28,394 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 04:53:28,396 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 04:53:28,398 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 04:53:28,400 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 04:53:28,402 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 04:53:28,404 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 04:53:28,406 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 04:53:28,544 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 04:53:28,546 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 04:53:28,552 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 04:53:28,736 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:53:28,736 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:53:28,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:28,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:28,737 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 04:53:28,738 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 04:53:28,740 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 04:53:28,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:28,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:28,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:28,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:28,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:28,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:28,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:28,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:28,776 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 04:53:28,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:28,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:28,778 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 04:53:28,779 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 04:53:28,781 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 04:53:28,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:28,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:28,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:28,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:28,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:28,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:28,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:28,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:28,820 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 04:53:28,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:28,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:28,822 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 04:53:28,823 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 04:53:28,824 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 04:53:28,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:28,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:28,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:28,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:28,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:28,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:28,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:28,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:28,862 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 04:53:28,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:28,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:28,864 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 04:53:28,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:28,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:28,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:28,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:28,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:28,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:28,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:28,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:28,892 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 04:53:28,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:28,926 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 04:53:28,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:28,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:28,929 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 04:53:28,932 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 04:53:28,933 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 04:53:28,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:28,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:28,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:28,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:28,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:28,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:28,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,019 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 04:53:29,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,021 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 04:53:29,027 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 04:53:29,027 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 04:53:29,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:29,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:29,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:29,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,050 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 04:53:29,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,052 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 04:53:29,052 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 04:53:29,054 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 04:53:29,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:29,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:29,073 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,088 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 04:53:29,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,090 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 04:53:29,091 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 04:53:29,093 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 04:53:29,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:29,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:29,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:29,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,132 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 04:53:29,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,133 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 04:53:29,134 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 04:53:29,135 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 04:53:29,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:29,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:29,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,180 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 04:53:29,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,181 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 04:53:29,182 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 04:53:29,183 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 04:53:29,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:29,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:29,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:29,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,228 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 04:53:29,229 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 04:53:29,231 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 04:53:29,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:29,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:29,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:29,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,253 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 04:53:29,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,255 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 04:53:29,255 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 04:53:29,256 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 04:53:29,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:29,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:29,297 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:53:29,308 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-13 04:53:29,308 INFO L444 ModelExtractionUtils]: 12 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-07-13 04:53:29,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,309 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 04:53:29,310 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 04:53:29,311 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:53:29,333 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 04:53:29,333 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:53:29,333 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~length2~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~length2~0#1 Supporting invariants [] [2022-07-13 04:53:29,351 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 04:53:29,370 INFO L293 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-07-13 04:53:29,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:29,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:53:29,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:29,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:53:29,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:29,425 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 04:53:29,426 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 04:53:29,426 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 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 04:53:29,444 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 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 31 states and 44 transitions. Complement of second has 6 states. [2022-07-13 04:53:29,445 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 04:53:29,445 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 04:53:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-07-13 04:53:29,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-13 04:53:29,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:29,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-13 04:53:29,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:29,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-13 04:53:29,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:29,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2022-07-13 04:53:29,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 04:53:29,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2022-07-13 04:53:29,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-13 04:53:29,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-13 04:53:29,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2022-07-13 04:53:29,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:29,457 INFO L369 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-07-13 04:53:29,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2022-07-13 04:53:29,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-13 04:53:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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 04:53:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2022-07-13 04:53:29,459 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-07-13 04:53:29,460 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-07-13 04:53:29,460 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:53:29,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2022-07-13 04:53:29,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 04:53:29,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:29,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:29,461 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:29,462 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:29,462 INFO L752 eck$LassoCheckResult]: Stem: 292#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 293#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 301#L532 assume !(main_~length1~0#1 < 1); 294#L532-2 assume !(main_~length2~0#1 < 1); 290#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 291#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 303#L541-4 main_~i~1#1 := 0; 297#L546-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 298#L546-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 302#L519-4 [2022-07-13 04:53:29,462 INFO L754 eck$LassoCheckResult]: Loop: 302#L519-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 309#L519-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 306#L522-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 310#L522-1 assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 305#L522-3 assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1; 295#L522-6 call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 296#L524 assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; 304#L519-3 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; 302#L519-4 [2022-07-13 04:53:29,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:29,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2022-07-13 04:53:29,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:29,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100807064] [2022-07-13 04:53:29,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:29,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:29,497 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:29,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:29,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:29,515 INFO L85 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 1 times [2022-07-13 04:53:29,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:29,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470217312] [2022-07-13 04:53:29,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:29,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:29,530 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:29,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:29,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:29,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1903570310, now seen corresponding path program 1 times [2022-07-13 04:53:29,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:29,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745588628] [2022-07-13 04:53:29,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:29,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:29,650 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 04:53:29,705 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 04:53:29,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:53:29,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745588628] [2022-07-13 04:53:29,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745588628] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:53:29,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:53:29,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 04:53:29,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637519512] [2022-07-13 04:53:29,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:53:29,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:53:29,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 04:53:29,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 04:53:29,862 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.8888888888888888) 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 04:53:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:53:29,973 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-07-13 04:53:29,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 04:53:29,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2022-07-13 04:53:29,975 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-13 04:53:29,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 42 transitions. [2022-07-13 04:53:29,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-13 04:53:29,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-13 04:53:29,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2022-07-13 04:53:29,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:29,976 INFO L369 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-13 04:53:29,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2022-07-13 04:53:29,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-07-13 04:53:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-13 04:53:29,978 INFO L392 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-13 04:53:29,978 INFO L374 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-13 04:53:29,978 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:53:29,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2022-07-13 04:53:29,978 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-13 04:53:29,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:29,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:29,979 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:29,979 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:29,979 INFO L752 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 370#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 379#L532 assume !(main_~length1~0#1 < 1); 371#L532-2 assume !(main_~length2~0#1 < 1); 367#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 368#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 380#L541-4 main_~i~1#1 := 0; 374#L546-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 375#L546-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 381#L519-4 [2022-07-13 04:53:29,979 INFO L754 eck$LassoCheckResult]: Loop: 381#L519-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 386#L519-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 388#L522-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 387#L522-1 assume !cstrpbrk_#t~short7#1; 382#L522-3 assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1; 372#L522-6 call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 373#L524 assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; 383#L519-3 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; 381#L519-4 [2022-07-13 04:53:29,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 2 times [2022-07-13 04:53:29,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:29,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477487810] [2022-07-13 04:53:29,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:29,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,003 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:30,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:30,014 INFO L85 PathProgramCache]: Analyzing trace with hash -903038413, now seen corresponding path program 1 times [2022-07-13 04:53:30,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:30,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788901880] [2022-07-13 04:53:30,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:30,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:30,054 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 04:53:30,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:53:30,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788901880] [2022-07-13 04:53:30,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788901880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:53:30,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:53:30,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 04:53:30,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655682594] [2022-07-13 04:53:30,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:53:30,056 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:53:30,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:53:30,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 04:53:30,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 04:53:30,057 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 04:53:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:53:30,104 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-07-13 04:53:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 04:53:30,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2022-07-13 04:53:30,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 04:53:30,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 23 states and 29 transitions. [2022-07-13 04:53:30,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-13 04:53:30,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-13 04:53:30,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2022-07-13 04:53:30,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:30,110 INFO L369 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-07-13 04:53:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2022-07-13 04:53:30,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-07-13 04:53:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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 04:53:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-07-13 04:53:30,113 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-07-13 04:53:30,113 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-07-13 04:53:30,113 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 04:53:30,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-07-13 04:53:30,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 04:53:30,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:30,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:30,115 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:30,115 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:30,116 INFO L752 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 453#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 461#L532 assume !(main_~length1~0#1 < 1); 454#L532-2 assume !(main_~length2~0#1 < 1); 450#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 451#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 463#L541-4 main_~i~1#1 := 0; 457#L546-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 458#L546-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 459#L546-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 460#L546-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 462#L519-4 [2022-07-13 04:53:30,116 INFO L754 eck$LassoCheckResult]: Loop: 462#L519-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 469#L519-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 465#L522-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 470#L522-1 assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 464#L522-3 assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1; 455#L522-6 call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 456#L524 assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; 466#L519-3 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; 462#L519-4 [2022-07-13 04:53:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:30,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2087704584, now seen corresponding path program 1 times [2022-07-13 04:53:30,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:30,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296808781] [2022-07-13 04:53:30,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:30,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,147 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:30,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:30,165 INFO L85 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 2 times [2022-07-13 04:53:30,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:30,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525941647] [2022-07-13 04:53:30,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:30,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,170 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:30,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:30,175 INFO L85 PathProgramCache]: Analyzing trace with hash 949013544, now seen corresponding path program 1 times [2022-07-13 04:53:30,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:30,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045677385] [2022-07-13 04:53:30,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:30,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:30,261 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 04:53:30,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:53:30,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045677385] [2022-07-13 04:53:30,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045677385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:53:30,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:53:30,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 04:53:30,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767482478] [2022-07-13 04:53:30,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:53:30,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:53:30,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 04:53:30,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 04:53:30,417 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 04:53:30,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:53:30,483 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-07-13 04:53:30,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 04:53:30,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2022-07-13 04:53:30,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 04:53:30,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 27 transitions. [2022-07-13 04:53:30,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-13 04:53:30,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-13 04:53:30,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2022-07-13 04:53:30,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:30,484 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-07-13 04:53:30,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2022-07-13 04:53:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-07-13 04:53:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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 04:53:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-07-13 04:53:30,485 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-07-13 04:53:30,485 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-07-13 04:53:30,485 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 04:53:30,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2022-07-13 04:53:30,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 04:53:30,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:30,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:30,486 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:30,486 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:30,486 INFO L752 eck$LassoCheckResult]: Stem: 518#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 519#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 527#L532 assume !(main_~length1~0#1 < 1); 520#L532-2 assume !(main_~length2~0#1 < 1); 516#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 517#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 533#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 534#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 528#L541-4 main_~i~1#1 := 0; 523#L546-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 524#L546-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 525#L546-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 526#L546-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 529#L519-4 [2022-07-13 04:53:30,486 INFO L754 eck$LassoCheckResult]: Loop: 529#L519-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 535#L519-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 531#L522-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 536#L522-1 assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 530#L522-3 assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1; 521#L522-6 call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 522#L524 assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; 532#L519-3 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; 529#L519-4 [2022-07-13 04:53:30,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:30,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2022-07-13 04:53:30,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:30,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380147420] [2022-07-13 04:53:30,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:30,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,497 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:30,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:30,513 INFO L85 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 3 times [2022-07-13 04:53:30,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:30,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830923783] [2022-07-13 04:53:30,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:30,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,521 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:30,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1875279350, now seen corresponding path program 1 times [2022-07-13 04:53:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:30,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794554596] [2022-07-13 04:53:30,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:30,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,544 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:31,509 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:53:31,509 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:53:31,509 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:53:31,509 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:53:31,509 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:53:31,509 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:31,509 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:53:31,509 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:53:31,509 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration6_Lasso [2022-07-13 04:53:31,509 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:53:31,509 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:53:31,514 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 04:53:31,516 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 04:53:31,518 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 04:53:31,519 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 04:53:31,520 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 04:53:31,522 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 04:53:31,523 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 04:53:31,524 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 04:53:31,526 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 04:53:31,527 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 04:53:31,529 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 04:53:31,531 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 04:53:31,532 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 04:53:31,534 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 04:53:31,536 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 04:53:31,537 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 04:53:31,538 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 04:53:31,540 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 04:53:31,541 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 04:53:31,542 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 04:53:32,080 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 04:53:32,083 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 04:53:32,085 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 04:53:32,086 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 04:53:32,087 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 04:53:32,089 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 04:53:32,091 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 04:53:32,630 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:53:32,630 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:53:32,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:32,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:32,632 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 04:53:32,636 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 04:53:32,636 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 04:53:32,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:32,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:32,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:32,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:32,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:32,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:32,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:32,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:32,679 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 04:53:32,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:32,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:32,681 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 04:53:32,688 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 04:53:32,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:32,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:32,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:32,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:32,696 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:32,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:32,705 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 04:53:32,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:32,746 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 04:53:32,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:32,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:32,747 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 04:53:32,748 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 04:53:32,750 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 04:53:32,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:32,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:32,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:32,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:32,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:32,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:32,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:32,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:32,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-07-13 04:53:32,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:32,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:32,798 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 04:53:32,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:32,801 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 04:53:32,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:32,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:32,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:32,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:32,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:32,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:32,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:32,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:32,833 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 04:53:32,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:32,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:32,834 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 04:53:32,835 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 04:53:32,836 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 04:53:32,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:32,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:32,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:32,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:32,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:32,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:32,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:32,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:32,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:32,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:32,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:32,872 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 04:53:32,872 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 04:53:32,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:32,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:32,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:32,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:32,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:32,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:32,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:32,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:32,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:32,897 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 04:53:32,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:32,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:32,899 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 04:53:32,900 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 04:53:32,906 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 04:53:32,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:32,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:32,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:32,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:32,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:32,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:32,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:32,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:32,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-13 04:53:32,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:32,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:32,945 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:32,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-13 04:53:32,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:32,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:32,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:32,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:32,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:32,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:32,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:32,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:33,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:33,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:33,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:33,013 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:33,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-13 04:53:33,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 04:53:33,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:33,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:33,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:33,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:33,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:33,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:33,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:33,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:33,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:33,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:33,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:33,060 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:33,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-13 04:53:33,063 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 04:53:33,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:33,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:33,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:33,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:33,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:33,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:33,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:33,088 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:33,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:33,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:33,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:33,105 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:33,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-13 04:53:33,107 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 04:53:33,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:33,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:33,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:33,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:33,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:33,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:33,118 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:33,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:33,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:33,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:33,134 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:33,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-13 04:53:33,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:33,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:33,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:33,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:33,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:33,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:33,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:33,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:33,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-13 04:53:33,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:33,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:33,177 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:33,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-13 04:53:33,179 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 04:53:33,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:33,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:33,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:33,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:33,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:33,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:33,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:33,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:33,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:33,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:33,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:33,221 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:33,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-13 04:53:33,224 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 04:53:33,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:33,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:33,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:33,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:33,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:33,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:33,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:33,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:33,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:33,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:33,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:33,255 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:33,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-13 04:53:33,257 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 04:53:33,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:33,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:33,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:33,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:33,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:33,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:33,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:33,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:33,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-13 04:53:33,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:33,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:33,280 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:33,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-13 04:53:33,282 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 04:53:33,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:33,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:33,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:33,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:33,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:33,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:33,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:33,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:33,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-13 04:53:33,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:33,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:33,315 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:33,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-13 04:53:33,318 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 04:53:33,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:33,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:33,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:33,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:33,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:33,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:33,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:33,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:33,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-13 04:53:33,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:33,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:33,341 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:33,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-13 04:53:33,343 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 04:53:33,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:33,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:33,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:33,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:33,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:33,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:33,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:33,349 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:33,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:33,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:33,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:33,366 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:33,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-13 04:53:33,368 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 04:53:33,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:33,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:33,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:33,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:33,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:33,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:33,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:33,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:33,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:33,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:33,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:33,391 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:33,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-13 04:53:33,393 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 04:53:33,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:33,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:33,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:33,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:33,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:33,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:33,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:33,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-13 04:53:33,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:33,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:33,427 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:33,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-13 04:53:33,429 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 04:53:33,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:33,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:33,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:33,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:33,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:33,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:33,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:33,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:33,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:33,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:33,476 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:33,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-13 04:53:33,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:33,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:33,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:33,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:33,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:33,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:33,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:33,511 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:53:33,540 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-13 04:53:33,540 INFO L444 ModelExtractionUtils]: 26 out of 58 variables were initially zero. Simplification set additionally 29 variables to zero. [2022-07-13 04:53:33,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:33,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:33,541 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:33,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-13 04:53:33,543 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:53:33,560 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 04:53:33,560 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:53:33,560 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0#1.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0#1.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0#1.base)_1 Supporting invariants [] [2022-07-13 04:53:33,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-13 04:53:33,619 INFO L293 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2022-07-13 04:53:33,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:33,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:53:33,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:33,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 04:53:33,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:33,722 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 04:53:33,724 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 04:53:33,724 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:33,737 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 36 transitions. Complement of second has 4 states. [2022-07-13 04:53:33,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-13 04:53:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-07-13 04:53:33,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 13 letters. Loop has 8 letters. [2022-07-13 04:53:33,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:33,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 21 letters. Loop has 8 letters. [2022-07-13 04:53:33,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:33,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 13 letters. Loop has 16 letters. [2022-07-13 04:53:33,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:33,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2022-07-13 04:53:33,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 04:53:33,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 33 transitions. [2022-07-13 04:53:33,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-13 04:53:33,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-13 04:53:33,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2022-07-13 04:53:33,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:53:33,743 INFO L369 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-07-13 04:53:33,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2022-07-13 04:53:33,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-13 04:53:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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 04:53:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-07-13 04:53:33,744 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-07-13 04:53:33,744 INFO L374 stractBuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-07-13 04:53:33,744 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 04:53:33,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2022-07-13 04:53:33,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 04:53:33,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:33,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:33,745 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:33,745 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 04:53:33,745 INFO L752 eck$LassoCheckResult]: Stem: 719#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 720#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 728#L532 assume !(main_~length1~0#1 < 1); 721#L532-2 assume !(main_~length2~0#1 < 1); 717#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 718#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 737#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 738#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 729#L541-4 main_~i~1#1 := 0; 724#L546-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 725#L546-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 726#L546-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 727#L546-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 730#L519-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 740#L519-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 732#L522-5 [2022-07-13 04:53:33,745 INFO L754 eck$LassoCheckResult]: Loop: 732#L522-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 741#L522-1 assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 731#L522-3 assume !!cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1;cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post8#1.base, 1 + cstrpbrk_#t~post8#1.offset;havoc cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset; 732#L522-5 [2022-07-13 04:53:33,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:33,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2055034687, now seen corresponding path program 1 times [2022-07-13 04:53:33,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:33,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421941118] [2022-07-13 04:53:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:33,758 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:33,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:33,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:33,773 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 1 times [2022-07-13 04:53:33,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:33,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603601090] [2022-07-13 04:53:33,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:33,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:33,788 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:33,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:33,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:33,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1074579938, now seen corresponding path program 1 times [2022-07-13 04:53:33,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:33,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866124114] [2022-07-13 04:53:33,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:33,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:33,809 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:33,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:33,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:34,960 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:53:34,960 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:53:34,960 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:53:34,960 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:53:34,960 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:53:34,960 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:34,961 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:53:34,961 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:53:34,961 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration7_Lasso [2022-07-13 04:53:34,961 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:53:34,961 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:53:34,963 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 04:53:34,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:34,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:34,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:34,972 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 04:53:34,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:34,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:34,985 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 04:53:34,986 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 04:53:34,988 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 04:53:34,989 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 04:53:34,990 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 04:53:34,991 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 04:53:34,993 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 04:53:34,994 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 04:53:34,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:34,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:34,997 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 04:53:34,998 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 04:53:35,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:35,001 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 04:53:35,004 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 04:53:35,537 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 04:53:35,543 INFO L158 Benchmark]: Toolchain (without parser) took 9842.50ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 54.3MB in the beginning and 73.1MB in the end (delta: -18.9MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2022-07-13 04:53:35,544 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:53:35,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.65ms. Allocated memory is still 92.3MB. Free memory was 54.1MB in the beginning and 66.1MB in the end (delta: -12.0MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2022-07-13 04:53:35,544 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.93ms. Allocated memory is still 92.3MB. Free memory was 66.1MB in the beginning and 64.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:53:35,544 INFO L158 Benchmark]: Boogie Preprocessor took 44.63ms. Allocated memory is still 92.3MB. Free memory was 64.0MB in the beginning and 62.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:53:35,545 INFO L158 Benchmark]: RCFGBuilder took 315.21ms. Allocated memory is still 92.3MB. Free memory was 62.7MB in the beginning and 50.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 04:53:35,545 INFO L158 Benchmark]: BuchiAutomizer took 9127.28ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 50.6MB in the beginning and 73.1MB in the end (delta: -22.6MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. [2022-07-13 04:53:35,546 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.16ms. Allocated memory is still 92.3MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.65ms. Allocated memory is still 92.3MB. Free memory was 54.1MB in the beginning and 66.1MB in the end (delta: -12.0MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.93ms. Allocated memory is still 92.3MB. Free memory was 66.1MB in the beginning and 64.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.63ms. Allocated memory is still 92.3MB. Free memory was 64.0MB in the beginning and 62.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 315.21ms. Allocated memory is still 92.3MB. Free memory was 62.7MB in the beginning and 50.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 9127.28ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 50.6MB in the beginning and 73.1MB in the end (delta: -22.6MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 04:53:35,568 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null