./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 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/cstrcspn-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15fe42cb945ebd9019cc38134c29264613097f232589ff55d01d33d66b19d85f --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 16:04:30,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 16:04:30,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 16:04:30,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 16:04:30,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 16:04:30,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 16:04:30,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 16:04:30,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 16:04:30,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 16:04:30,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 16:04:30,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 16:04:30,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 16:04:30,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 16:04:30,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 16:04:30,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 16:04:30,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 16:04:30,931 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 16:04:30,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 16:04:30,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 16:04:30,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 16:04:30,940 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 16:04:30,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 16:04:30,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 16:04:30,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 16:04:30,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 16:04:30,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 16:04:30,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 16:04:30,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 16:04:30,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 16:04:30,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 16:04:30,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 16:04:30,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 16:04:30,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 16:04:30,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 16:04:30,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 16:04:30,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 16:04:30,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 16:04:30,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 16:04:30,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 16:04:30,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 16:04:30,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 16:04:30,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 16:04:30,959 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 16:04:30,988 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 16:04:30,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 16:04:30,989 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 16:04:30,989 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 16:04:30,990 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 16:04:30,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 16:04:30,990 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 16:04:30,991 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 16:04:30,991 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 16:04:30,991 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 16:04:30,992 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 16:04:30,992 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 16:04:30,992 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 16:04:30,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 16:04:30,992 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 16:04:30,993 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 16:04:30,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 16:04:30,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 16:04:30,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 16:04:30,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 16:04:30,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 16:04:30,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 16:04:30,995 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 16:04:30,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 16:04:30,995 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 16:04:30,995 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 16:04:30,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 16:04:30,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 16:04:30,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 16:04:30,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 16:04:30,996 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 16:04:30,997 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 16:04:30,997 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 -> 15fe42cb945ebd9019cc38134c29264613097f232589ff55d01d33d66b19d85f [2022-07-23 16:04:31,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 16:04:31,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 16:04:31,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 16:04:31,274 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 16:04:31,275 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 16:04:31,276 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2022-07-23 16:04:31,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d6784f8/44e87f572cd74fdaa40cebd40449daa0/FLAGcf8db4088 [2022-07-23 16:04:31,745 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 16:04:31,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2022-07-23 16:04:31,762 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d6784f8/44e87f572cd74fdaa40cebd40449daa0/FLAGcf8db4088 [2022-07-23 16:04:32,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d6784f8/44e87f572cd74fdaa40cebd40449daa0 [2022-07-23 16:04:32,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 16:04:32,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 16:04:32,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 16:04:32,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 16:04:32,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 16:04:32,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:04:32" (1/1) ... [2022-07-23 16:04:32,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@633cc377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:32, skipping insertion in model container [2022-07-23 16:04:32,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:04:32" (1/1) ... [2022-07-23 16:04:32,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 16:04:32,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 16:04:32,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 16:04:32,406 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 16:04:32,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 16:04:32,468 INFO L208 MainTranslator]: Completed translation [2022-07-23 16:04:32,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:32 WrapperNode [2022-07-23 16:04:32,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 16:04:32,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 16:04:32,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 16:04:32,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 16:04:32,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:32" (1/1) ... [2022-07-23 16:04:32,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:32" (1/1) ... [2022-07-23 16:04:32,533 INFO L137 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2022-07-23 16:04:32,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 16:04:32,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 16:04:32,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 16:04:32,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 16:04:32,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:32" (1/1) ... [2022-07-23 16:04:32,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:32" (1/1) ... [2022-07-23 16:04:32,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:32" (1/1) ... [2022-07-23 16:04:32,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:32" (1/1) ... [2022-07-23 16:04:32,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:32" (1/1) ... [2022-07-23 16:04:32,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:32" (1/1) ... [2022-07-23 16:04:32,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:32" (1/1) ... [2022-07-23 16:04:32,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 16:04:32,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 16:04:32,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 16:04:32,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 16:04:32,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:32" (1/1) ... [2022-07-23 16:04:32,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:32,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:32,661 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-23 16:04:32,672 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-23 16:04:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 16:04:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 16:04:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 16:04:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 16:04:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 16:04:32,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 16:04:32,770 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 16:04:32,772 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 16:04:32,924 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 16:04:32,930 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 16:04:32,930 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-23 16:04:32,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:04:32 BoogieIcfgContainer [2022-07-23 16:04:32,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 16:04:32,933 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 16:04:32,933 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 16:04:32,936 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 16:04:32,937 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:04:32,937 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 04:04:32" (1/3) ... [2022-07-23 16:04:32,938 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69676597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 04:04:32, skipping insertion in model container [2022-07-23 16:04:32,939 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:04:32,939 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:32" (2/3) ... [2022-07-23 16:04:32,939 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69676597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 04:04:32, skipping insertion in model container [2022-07-23 16:04:32,939 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:04:32,939 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:04:32" (3/3) ... [2022-07-23 16:04:32,941 INFO L354 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca-1.i [2022-07-23 16:04:32,986 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 16:04:32,986 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 16:04:32,986 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 16:04:32,986 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 16:04:32,987 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 16:04:32,987 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 16:04:32,987 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 16:04:32,987 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 16:04:32,991 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-23 16:04:33,009 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-07-23 16:04:33,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:33,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:33,021 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-23 16:04:33,023 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:04:33,023 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 16:04:33,023 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-23 16:04:33,025 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-07-23 16:04:33,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:33,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:33,027 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-23 16:04:33,027 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:04:33,035 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, 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); 6#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; 17#L541-3true [2022-07-23 16:04:33,035 INFO L754 eck$LassoCheckResult]: Loop: 17#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; 17#L541-3true [2022-07-23 16:04:33,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:33,051 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-07-23 16:04:33,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:33,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160538137] [2022-07-23 16:04:33,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:33,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:33,163 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:33,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:33,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:33,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-07-23 16:04:33,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:33,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074017169] [2022-07-23 16:04:33,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:33,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:33,220 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:33,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:33,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:33,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-07-23 16:04:33,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:33,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307088701] [2022-07-23 16:04:33,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:33,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:33,291 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:33,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:33,750 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:04:33,751 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:04:33,751 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:04:33,751 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:04:33,751 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:04:33,752 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:33,752 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:04:33,752 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:04:33,752 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration1_Lasso [2022-07-23 16:04:33,752 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:04:33,753 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:04:33,769 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-23 16:04:33,941 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-23 16:04:33,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:33,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:33,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:33,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:33,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:33,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:33,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-23 16:04:33,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-23 16:04:33,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-23 16:04:33,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:33,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:33,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:33,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:34,264 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 16:04:34,268 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 16:04:34,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:34,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:34,272 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-23 16:04:34,280 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-23 16:04:34,281 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-23 16:04:34,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:34,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:34,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:34,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:34,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:34,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:34,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:34,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-23 16:04:34,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:34,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:34,340 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-23 16:04:34,341 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-23 16:04:34,342 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-23 16:04:34,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:34,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:34,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:34,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:34,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:34,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:34,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:34,383 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-23 16:04:34,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:34,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:34,385 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-23 16:04:34,390 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-23 16:04:34,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:34,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:34,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:34,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:34,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:34,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:34,422 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 16:04:34,423 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-23 16:04:34,459 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-07-23 16:04:34,459 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-23 16:04:34,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:34,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:34,468 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-23 16:04:34,487 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-23 16:04:34,491 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 16:04:34,513 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-23 16:04:34,514 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 16:04:34,514 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-23 16:04:34,553 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-23 16:04:34,587 INFO L293 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2022-07-23 16:04:34,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:34,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 16:04:34,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:04:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:34,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 16:04:34,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:04:34,715 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-23 16:04:34,755 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-23 16:04:34,756 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-23 16:04:34,847 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-23 16:04:34,849 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-23 16:04:34,857 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-23 16:04:34,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-07-23 16:04:34,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-23 16:04:34,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:34,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-23 16:04:34,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:34,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-23 16:04:34,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:34,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. [2022-07-23 16:04:34,871 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-23 16:04:34,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 27 transitions. [2022-07-23 16:04:34,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 16:04:34,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-23 16:04:34,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2022-07-23 16:04:34,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:04:34,878 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-23 16:04:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2022-07-23 16:04:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-23 16:04:34,898 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-23 16:04:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-07-23 16:04:34,900 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-23 16:04:34,901 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-23 16:04:34,901 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 16:04:34,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2022-07-23 16:04:34,903 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-23 16:04:34,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:34,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:34,903 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:04:34,903 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:04:34,904 INFO L752 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 170#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, 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; 174#L532 assume !(main_~length1~0#1 < 1); 171#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); 175#L541-4 main_~i~1#1 := 0; 168#L547-3 [2022-07-23 16:04:34,904 INFO L754 eck$LassoCheckResult]: Loop: 168#L547-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; 167#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 168#L547-3 [2022-07-23 16:04:34,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:34,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-07-23 16:04:34,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:34,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869524119] [2022-07-23 16:04:34,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:34,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:34,941 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:34,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-07-23 16:04:34,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:34,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724113894] [2022-07-23 16:04:34,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:34,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:34,976 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:34,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:34,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:34,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-07-23 16:04:34,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:34,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818689889] [2022-07-23 16:04:34,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:34,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:35,021 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:35,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:35,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-23 16:04:35,331 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:04:35,331 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:04:35,331 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:04:35,331 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:04:35,331 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:04:35,331 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:35,331 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:04:35,331 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:04:35,331 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration2_Lasso [2022-07-23 16:04:35,331 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:04:35,331 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:04:35,334 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-23 16:04:35,336 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-23 16:04:35,338 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-23 16:04:35,340 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-23 16:04:35,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-23 16:04:35,347 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-23 16:04:35,349 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-23 16:04:35,351 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-23 16:04:35,354 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-23 16:04:35,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-23 16:04:35,503 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-23 16:04:35,506 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-23 16:04:35,508 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-23 16:04:35,511 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-23 16:04:35,737 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 16:04:35,737 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 16:04:35,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:35,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:35,740 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-23 16:04:35,742 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-23 16:04:35,743 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-23 16:04:35,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:35,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:35,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:35,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:35,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:35,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:35,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:35,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:35,801 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-23 16:04:35,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:35,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:35,803 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-23 16:04:35,810 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-23 16:04:35,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:35,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:35,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:35,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:35,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:35,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:35,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:35,820 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-23 16:04:35,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:35,861 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-23 16:04:35,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:35,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:35,863 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-23 16:04:35,865 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-23 16:04:35,866 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-23 16:04:35,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:35,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:35,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:35,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:35,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:35,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:35,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:35,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:35,918 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-23 16:04:35,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:35,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:35,920 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-23 16:04:35,926 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-23 16:04:35,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:35,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:35,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:35,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:35,936 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-23 16:04:35,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:35,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:35,946 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:35,962 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-23 16:04:35,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:35,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:35,964 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-23 16:04:35,965 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-23 16:04:35,966 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-23 16:04:35,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:35,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:35,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:35,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:35,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:35,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:35,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:35,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-23 16:04:35,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:35,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:35,998 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-23 16:04:35,999 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-23 16:04:36,000 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-23 16:04:36,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:36,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:36,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:36,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:36,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:36,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:36,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:36,018 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:36,034 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-23 16:04:36,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:36,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:36,036 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-23 16:04:36,037 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-23 16:04:36,037 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-23 16:04:36,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:36,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:36,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:36,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:36,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:36,045 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:36,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:36,063 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-23 16:04:36,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:36,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:36,065 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-23 16:04:36,065 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-23 16:04:36,067 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-23 16:04:36,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:36,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:36,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:36,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:36,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:36,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:36,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:36,120 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-23 16:04:36,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:36,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:36,121 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-23 16:04:36,122 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-23 16:04:36,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:04:36,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:36,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:36,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:36,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:36,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:36,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:36,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:36,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:36,147 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-23 16:04:36,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:36,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:36,148 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-23 16:04:36,149 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-23 16:04:36,150 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-23 16:04:36,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:36,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:36,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:36,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:36,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:36,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:36,191 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 16:04:36,208 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-23 16:04:36,208 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-23 16:04:36,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:36,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:36,212 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-23 16:04:36,246 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 16:04:36,254 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-23 16:04:36,272 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-23 16:04:36,272 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 16:04:36,272 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_2) = -1*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_2 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_2 - 1*ULTIMATE.start_main_~length2~0#1 >= 0] [2022-07-23 16:04:36,299 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-23 16:04:36,314 INFO L293 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2022-07-23 16:04:36,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:36,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 16:04:36,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:04:36,401 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 16:04:36,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 16:04:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:36,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 16:04:36,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:04:36,447 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-23 16:04:36,448 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-07-23 16:04:36,448 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:36,495 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 44 transitions. Complement of second has 7 states. [2022-07-23 16:04:36,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 16:04:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-07-23 16:04:36,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-23 16:04:36,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:36,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-23 16:04:36,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:36,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-23 16:04:36,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:36,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2022-07-23 16:04:36,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-23 16:04:36,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2022-07-23 16:04:36,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-23 16:04:36,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 16:04:36,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2022-07-23 16:04:36,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:04:36,500 INFO L369 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-07-23 16:04:36,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2022-07-23 16:04:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-23 16:04:36,501 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-23 16:04:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2022-07-23 16:04:36,502 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-07-23 16:04:36,502 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-07-23 16:04:36,502 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 16:04:36,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2022-07-23 16:04:36,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-23 16:04:36,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:36,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:36,503 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:04:36,504 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:04:36,504 INFO L752 eck$LassoCheckResult]: Stem: 303#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 304#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, 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; 310#L532 assume !(main_~length1~0#1 < 1); 307#L532-2 assume !(main_~length2~0#1 < 1); 301#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; 302#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 311#L541-4 main_~i~1#1 := 0; 312#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 317#L547-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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 316#L519-4 [2022-07-23 16:04:36,504 INFO L754 eck$LassoCheckResult]: Loop: 316#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 320#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 314#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 321#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 313#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 308#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 309#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 315#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 316#L519-4 [2022-07-23 16:04:36,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2022-07-23 16:04:36,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:36,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335006031] [2022-07-23 16:04:36,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:36,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:36,519 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:36,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:36,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:36,531 INFO L85 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 1 times [2022-07-23 16:04:36,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:36,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253997498] [2022-07-23 16:04:36,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:36,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:36,540 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:36,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:36,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:36,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1903570310, now seen corresponding path program 1 times [2022-07-23 16:04:36,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:36,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778664558] [2022-07-23 16:04:36,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:36,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:36,695 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-23 16:04:36,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:04:36,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778664558] [2022-07-23 16:04:36,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778664558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 16:04:36,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 16:04:36,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 16:04:36,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512327668] [2022-07-23 16:04:36,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 16:04:36,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:04:36,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 16:04:36,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-23 16:04:36,909 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-23 16:04:37,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:04:37,042 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-07-23 16:04:37,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 16:04:37,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2022-07-23 16:04:37,044 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-23 16:04:37,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 42 transitions. [2022-07-23 16:04:37,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-23 16:04:37,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-23 16:04:37,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2022-07-23 16:04:37,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:04:37,045 INFO L369 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-23 16:04:37,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2022-07-23 16:04:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-07-23 16:04:37,048 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-23 16:04:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-23 16:04:37,049 INFO L392 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-23 16:04:37,049 INFO L374 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-23 16:04:37,049 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 16:04:37,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2022-07-23 16:04:37,049 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-23 16:04:37,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:37,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:37,050 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:04:37,050 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:04:37,050 INFO L752 eck$LassoCheckResult]: Stem: 382#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 383#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, 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; 389#L532 assume !(main_~length1~0#1 < 1); 386#L532-2 assume !(main_~length2~0#1 < 1); 380#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; 381#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 390#L541-4 main_~i~1#1 := 0; 391#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 395#L547-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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 394#L519-4 [2022-07-23 16:04:37,050 INFO L754 eck$LassoCheckResult]: Loop: 394#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 399#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 401#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 400#L522-1 assume !cstrcspn_#t~short7#1; 392#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 387#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 388#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 393#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 394#L519-4 [2022-07-23 16:04:37,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 2 times [2022-07-23 16:04:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:37,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665701577] [2022-07-23 16:04:37,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:37,063 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:37,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:37,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:37,074 INFO L85 PathProgramCache]: Analyzing trace with hash -903038413, now seen corresponding path program 1 times [2022-07-23 16:04:37,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:37,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920476621] [2022-07-23 16:04:37,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:37,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:37,080 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:37,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:37,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:37,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1905417352, now seen corresponding path program 1 times [2022-07-23 16:04:37,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:37,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480341248] [2022-07-23 16:04:37,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:37,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:37,161 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-23 16:04:37,298 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-23 16:04:37,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:04:37,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480341248] [2022-07-23 16:04:37,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480341248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 16:04:37,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 16:04:37,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 16:04:37,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514776936] [2022-07-23 16:04:37,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 16:04:37,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:04:37,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 16:04:37,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-23 16:04:37,424 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 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-23 16:04:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:04:37,702 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-07-23 16:04:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 16:04:37,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 80 transitions. [2022-07-23 16:04:37,704 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2022-07-23 16:04:37,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 61 states and 75 transitions. [2022-07-23 16:04:37,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-23 16:04:37,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-23 16:04:37,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 75 transitions. [2022-07-23 16:04:37,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:04:37,706 INFO L369 hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions. [2022-07-23 16:04:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 75 transitions. [2022-07-23 16:04:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 40. [2022-07-23 16:04:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 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-23 16:04:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-07-23 16:04:37,710 INFO L392 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-07-23 16:04:37,710 INFO L374 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-07-23 16:04:37,710 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 16:04:37,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2022-07-23 16:04:37,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-23 16:04:37,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:37,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:37,712 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:04:37,712 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:04:37,712 INFO L752 eck$LassoCheckResult]: Stem: 505#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 506#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, 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; 512#L532 assume !(main_~length1~0#1 < 1); 509#L532-2 assume !(main_~length2~0#1 < 1); 503#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; 504#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; 520#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 521#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 513#L541-4 main_~i~1#1 := 0; 514#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 532#L547-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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 536#L519-4 [2022-07-23 16:04:37,712 INFO L754 eck$LassoCheckResult]: Loop: 536#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 535#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 534#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 527#L522-1 assume !cstrcspn_#t~short7#1; 528#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 539#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 538#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 537#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 536#L519-4 [2022-07-23 16:04:37,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:37,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2022-07-23 16:04:37,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:37,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925527456] [2022-07-23 16:04:37,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:37,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:37,725 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:37,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:37,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:37,735 INFO L85 PathProgramCache]: Analyzing trace with hash -903038413, now seen corresponding path program 2 times [2022-07-23 16:04:37,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:37,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249065018] [2022-07-23 16:04:37,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:37,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:37,740 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:37,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:37,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:37,745 INFO L85 PathProgramCache]: Analyzing trace with hash -162323734, now seen corresponding path program 1 times [2022-07-23 16:04:37,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:37,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302697890] [2022-07-23 16:04:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:37,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:37,759 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:37,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:38,469 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:04:38,470 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:04:38,470 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:04:38,470 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:04:38,470 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:04:38,470 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:38,470 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:04:38,470 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:04:38,470 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration5_Lasso [2022-07-23 16:04:38,470 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:04:38,470 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:04:38,473 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-23 16:04:38,476 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-23 16:04:38,477 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-23 16:04:38,479 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-23 16:04:38,974 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-23 16:04:38,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:38,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:38,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:38,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:38,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:38,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-23 16:04:38,987 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-23 16:04:38,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-23 16:04:38,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-23 16:04:38,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-23 16:04:38,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-23 16:04:38,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-23 16:04:38,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:39,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-23 16:04:39,003 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-23 16:04:39,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:39,006 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-23 16:04:39,008 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-23 16:04:39,010 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-23 16:04:39,012 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-23 16:04:39,481 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 16:04:39,481 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 16:04:39,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:39,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:39,485 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-23 16:04:39,493 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-23 16:04:39,494 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-23 16:04:39,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:39,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:39,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:39,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:39,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:39,502 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:39,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:39,522 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-23 16:04:39,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:39,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:39,524 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-23 16:04:39,524 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-23 16:04:39,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:04:39,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:39,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:39,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:39,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:39,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:39,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:39,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:39,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:39,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-23 16:04:39,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:39,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:39,550 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-23 16:04:39,552 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-23 16:04:39,555 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-23 16:04:39,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:39,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:39,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:39,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:39,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:39,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:39,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:39,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:39,575 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-23 16:04:39,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:39,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:39,577 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-23 16:04:39,580 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-23 16:04:39,581 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-23 16:04:39,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:39,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:39,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:39,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:39,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:39,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:39,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:39,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:39,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:39,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:39,611 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-23 16:04:39,612 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-23 16:04:39,613 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-23 16:04:39,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:39,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:39,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:39,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:39,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:39,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:39,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:39,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:39,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:39,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:39,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:39,640 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-23 16:04:39,641 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-23 16:04:39,642 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-23 16:04:39,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:39,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:39,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:39,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:39,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:39,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:39,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:39,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:39,665 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-23 16:04:39,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:39,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:39,666 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-23 16:04:39,667 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-23 16:04:39,668 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-23 16:04:39,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:39,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:39,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:39,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:39,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:39,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:39,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:39,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-23 16:04:39,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:39,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:39,721 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-23 16:04:39,722 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-23 16:04:39,725 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-23 16:04:39,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:39,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:39,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:39,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:39,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:39,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:39,734 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:39,750 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-23 16:04:39,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:39,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:39,751 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-23 16:04:39,751 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-23 16:04:39,753 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-23 16:04:39,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:39,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:39,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:39,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:39,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:39,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:39,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:39,791 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-23 16:04:39,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:39,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:39,793 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-23 16:04:39,793 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-23 16:04:39,795 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-23 16:04:39,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:39,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:39,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:39,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:39,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:39,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:39,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:39,869 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-23 16:04:39,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:39,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:39,872 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-23 16:04:39,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-23 16:04:39,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:39,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:39,883 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 16:04:39,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:39,889 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-23 16:04:39,889 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-23 16:04:39,901 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-23 16:04:39,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:39,939 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-23 16:04:39,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:39,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:39,940 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-23 16:04:39,943 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-23 16:04:39,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:39,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:39,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:39,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:39,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:39,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:39,968 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-23 16:04:39,987 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 16:04:40,018 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-23 16:04:40,018 INFO L444 ModelExtractionUtils]: 45 out of 61 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-07-23 16:04:40,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:40,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:40,019 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-23 16:04:40,020 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-23 16:04:40,021 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 16:04:40,030 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 16:04:40,030 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 16:04:40,030 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3) = -1*ULTIMATE.start_cstrcspn_~sc1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3 Supporting invariants [] [2022-07-23 16:04:40,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-23 16:04:40,094 INFO L293 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2022-07-23 16:04:40,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:40,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 16:04:40,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:04:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:40,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 16:04:40,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:04:40,266 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-23 16:04:40,275 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-23 16:04:40,276 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-07-23 16:04:40,276 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:40,316 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 74 transitions. Complement of second has 5 states. [2022-07-23 16:04:40,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-23 16:04:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-07-23 16:04:40,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 8 letters. [2022-07-23 16:04:40,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:40,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 19 letters. Loop has 8 letters. [2022-07-23 16:04:40,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:40,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 16 letters. [2022-07-23 16:04:40,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:40,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 74 transitions. [2022-07-23 16:04:40,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 16:04:40,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 39 states and 50 transitions. [2022-07-23 16:04:40,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-23 16:04:40,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-23 16:04:40,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2022-07-23 16:04:40,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 16:04:40,323 INFO L369 hiAutomatonCegarLoop]: Abstraction has 39 states and 50 transitions. [2022-07-23 16:04:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2022-07-23 16:04:40,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-07-23 16:04:40,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 35 states have internal predecessors, (47), 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-23 16:04:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-07-23 16:04:40,328 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-07-23 16:04:40,328 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-07-23 16:04:40,328 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 16:04:40,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2022-07-23 16:04:40,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 16:04:40,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:40,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:40,329 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:04:40,330 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 16:04:40,330 INFO L752 eck$LassoCheckResult]: Stem: 746#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 747#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, 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; 753#L532 assume !(main_~length1~0#1 < 1); 750#L532-2 assume !(main_~length2~0#1 < 1); 744#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; 745#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 754#L541-4 main_~i~1#1 := 0; 755#L547-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; 748#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 749#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 779#L547-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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 778#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 767#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 757#L522-5 [2022-07-23 16:04:40,330 INFO L754 eck$LassoCheckResult]: Loop: 757#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 771#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 756#L522-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 757#L522-5 [2022-07-23 16:04:40,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:40,331 INFO L85 PathProgramCache]: Analyzing trace with hash -534376483, now seen corresponding path program 1 times [2022-07-23 16:04:40,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:40,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336828630] [2022-07-23 16:04:40,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:40,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:40,451 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-23 16:04:40,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:04:40,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336828630] [2022-07-23 16:04:40,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336828630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 16:04:40,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 16:04:40,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 16:04:40,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186340924] [2022-07-23 16:04:40,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 16:04:40,452 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:04:40,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:40,453 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 1 times [2022-07-23 16:04:40,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:40,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546203210] [2022-07-23 16:04:40,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:40,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:40,464 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:40,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:40,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:04:40,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 16:04:40,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 16:04:40,562 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 16 Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:40,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:04:40,620 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-07-23 16:04:40,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 16:04:40,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2022-07-23 16:04:40,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 16:04:40,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 28 states and 36 transitions. [2022-07-23 16:04:40,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-23 16:04:40,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-23 16:04:40,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2022-07-23 16:04:40,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 16:04:40,622 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-07-23 16:04:40,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2022-07-23 16:04:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-23 16:04:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 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-23 16:04:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-07-23 16:04:40,624 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-23 16:04:40,624 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-23 16:04:40,624 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 16:04:40,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2022-07-23 16:04:40,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 16:04:40,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:40,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:40,625 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:04:40,625 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 16:04:40,625 INFO L752 eck$LassoCheckResult]: Stem: 832#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 833#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, 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; 839#L532 assume !(main_~length1~0#1 < 1); 836#L532-2 assume !(main_~length2~0#1 < 1); 830#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; 831#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; 849#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 850#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 840#L541-4 main_~i~1#1 := 0; 841#L547-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; 834#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 835#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 847#L547-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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 848#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 852#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 843#L522-5 [2022-07-23 16:04:40,625 INFO L754 eck$LassoCheckResult]: Loop: 843#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 853#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 842#L522-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 843#L522-5 [2022-07-23 16:04:40,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:40,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2055034687, now seen corresponding path program 1 times [2022-07-23 16:04:40,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:40,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359573428] [2022-07-23 16:04:40,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:40,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:40,640 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:40,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:40,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:40,652 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 2 times [2022-07-23 16:04:40,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:40,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124667575] [2022-07-23 16:04:40,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:40,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:40,657 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:40,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:40,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:40,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1074579938, now seen corresponding path program 1 times [2022-07-23 16:04:40,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:40,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548236254] [2022-07-23 16:04:40,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:40,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:40,675 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:40,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:41,661 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:04:41,661 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:04:41,661 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:04:41,663 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:04:41,663 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:04:41,663 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:41,663 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:04:41,663 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:04:41,664 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration7_Lasso [2022-07-23 16:04:41,664 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:04:41,664 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:04:41,668 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-23 16:04:41,673 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-23 16:04:41,675 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-23 16:04:41,677 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-23 16:04:41,678 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-23 16:04:41,680 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-23 16:04:41,682 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-23 16:04:42,336 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-23 16:04:42,338 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-23 16:04:42,340 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-23 16:04:42,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-23 16:04:42,346 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-23 16:04:42,348 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-23 16:04:42,349 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-23 16:04:42,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-23 16:04:42,353 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-23 16:04:42,359 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-23 16:04:42,361 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-23 16:04:42,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-23 16:04:42,364 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-23 16:04:42,366 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-23 16:04:42,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:42,369 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-23 16:04:42,371 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-23 16:04:42,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-23 16:04:43,079 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 16:04:43,079 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 16:04:43,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:43,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:43,084 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-23 16:04:43,092 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-23 16:04:43,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:43,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:43,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:43,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:43,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:43,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:43,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:43,102 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-23 16:04:43,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:43,128 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-23 16:04:43,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:43,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:43,129 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-23 16:04:43,131 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-23 16:04:43,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:04:43,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:43,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:43,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:43,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:43,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:43,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:43,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:43,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:43,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-23 16:04:43,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:43,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:43,157 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-23 16:04:43,158 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-23 16:04:43,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:04:43,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:43,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:43,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:43,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:43,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:43,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:43,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:43,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-23 16:04:43,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:43,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:43,183 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-23 16:04:43,184 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-23 16:04:43,185 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-23 16:04:43,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:43,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:43,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:43,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:43,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:43,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:43,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:43,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:43,207 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-23 16:04:43,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:43,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:43,208 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-23 16:04:43,209 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-23 16:04:43,210 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-23 16:04:43,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:43,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:43,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:43,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:43,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:43,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:43,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:43,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:43,232 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-23 16:04:43,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:43,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:43,233 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-23 16:04:43,234 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-23 16:04:43,236 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-23 16:04:43,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:43,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:43,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:43,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:43,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:43,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:43,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:43,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:43,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:43,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:43,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:43,260 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-23 16:04:43,267 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-23 16:04:43,267 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-23 16:04:43,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:43,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:43,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:43,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:43,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:43,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:43,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:43,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-23 16:04:43,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:43,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:43,296 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-23 16:04:43,297 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-23 16:04:43,298 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-23 16:04:43,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:43,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:43,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:43,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:43,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:43,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:43,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:43,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-23 16:04:43,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:43,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:43,324 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-23 16:04:43,324 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-23 16:04:43,327 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-23 16:04:43,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:43,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:43,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:43,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:43,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:43,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:43,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:43,352 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-23 16:04:43,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:43,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:43,353 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-23 16:04:43,353 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-23 16:04:43,355 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-23 16:04:43,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:43,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:43,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:43,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:43,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:43,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:43,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:43,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-23 16:04:43,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:43,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:43,389 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-23 16:04:43,390 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-23 16:04:43,392 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-23 16:04:43,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:43,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:43,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:43,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:43,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:43,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:43,432 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 16:04:43,480 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2022-07-23 16:04:43,480 INFO L444 ModelExtractionUtils]: 20 out of 58 variables were initially zero. Simplification set additionally 33 variables to zero. [2022-07-23 16:04:43,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:43,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:43,482 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-23 16:04:43,482 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-23 16:04:43,483 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 16:04:43,490 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-23 16:04:43,490 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 16:04:43,490 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_2, ULTIMATE.start_cstrcspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0#1.offset Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_2 - 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_4 >= 0] [2022-07-23 16:04:43,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:43,601 INFO L293 tatePredicateManager]: 25 out of 27 supporting invariants were superfluous and have been removed [2022-07-23 16:04:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:43,658 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-23 16:04:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:43,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 16:04:43,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:04:43,692 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 16:04:43,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 16:04:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:43,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 16:04:43,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:04:43,890 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-23 16:04:43,891 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2022-07-23 16:04:43,891 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:44,124 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 64 states and 79 transitions. Complement of second has 12 states. [2022-07-23 16:04:44,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 1 non-accepting loop states 2 accepting loop states [2022-07-23 16:04:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-07-23 16:04:44,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 35 transitions. Stem has 15 letters. Loop has 3 letters. [2022-07-23 16:04:44,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:44,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 35 transitions. Stem has 18 letters. Loop has 3 letters. [2022-07-23 16:04:44,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:44,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 35 transitions. Stem has 15 letters. Loop has 6 letters. [2022-07-23 16:04:44,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:44,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 79 transitions. [2022-07-23 16:04:44,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 16:04:44,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 50 states and 62 transitions. [2022-07-23 16:04:44,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-23 16:04:44,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-23 16:04:44,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 62 transitions. [2022-07-23 16:04:44,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 16:04:44,129 INFO L369 hiAutomatonCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-07-23 16:04:44,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 62 transitions. [2022-07-23 16:04:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2022-07-23 16:04:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 35 states have internal predecessors, (47), 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-23 16:04:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-07-23 16:04:44,131 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-07-23 16:04:44,132 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-07-23 16:04:44,132 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-23 16:04:44,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2022-07-23 16:04:44,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 16:04:44,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:44,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:44,133 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:04:44,133 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 16:04:44,133 INFO L752 eck$LassoCheckResult]: Stem: 1139#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1140#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, 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; 1146#L532 assume !(main_~length1~0#1 < 1); 1143#L532-2 assume !(main_~length2~0#1 < 1); 1137#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; 1138#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; 1157#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1158#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 1147#L541-4 main_~i~1#1 := 0; 1148#L547-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; 1141#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1142#L547-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; 1161#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1159#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 1160#L547-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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 1162#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1164#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 1150#L522-5 [2022-07-23 16:04:44,133 INFO L754 eck$LassoCheckResult]: Loop: 1150#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 1165#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 1149#L522-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 1150#L522-5 [2022-07-23 16:04:44,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:44,133 INFO L85 PathProgramCache]: Analyzing trace with hash -743422367, now seen corresponding path program 2 times [2022-07-23 16:04:44,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:44,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967529934] [2022-07-23 16:04:44,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:44,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:44,146 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:44,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:44,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:44,158 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 3 times [2022-07-23 16:04:44,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:44,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707710946] [2022-07-23 16:04:44,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:44,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:44,162 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:44,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:44,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:44,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1850666880, now seen corresponding path program 2 times [2022-07-23 16:04:44,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:44,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714301169] [2022-07-23 16:04:44,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:44,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:44,180 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:44,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:45,477 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:04:45,477 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:04:45,477 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:04:45,477 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:04:45,477 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:04:45,477 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:45,477 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:04:45,477 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:04:45,477 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration8_Lasso [2022-07-23 16:04:45,477 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:04:45,477 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:04:45,480 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-23 16:04:45,487 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-23 16:04:45,489 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-23 16:04:45,490 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-23 16:04:45,492 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-23 16:04:45,494 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-23 16:04:45,500 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-23 16:04:45,503 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-23 16:04:45,505 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-23 16:04:45,507 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-23 16:04:46,231 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-23 16:04:46,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:46,234 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-23 16:04:46,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:46,237 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-23 16:04:46,238 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-23 16:04:46,240 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-23 16:04:46,242 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-23 16:04:46,243 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-23 16:04:46,244 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-23 16:04:46,246 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-23 16:04:46,247 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-23 16:04:46,249 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-23 16:04:46,250 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-23 16:04:46,252 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-23 16:04:46,254 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-23 16:04:46,947 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 16:04:46,947 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 16:04:46,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:46,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:46,949 INFO L229 MonitoredProcess]: Starting monitored process 42 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-23 16:04:46,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-23 16:04:46,951 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-23 16:04:46,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:46,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:46,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:46,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:46,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:46,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:46,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:46,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:46,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-23 16:04:46,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:46,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:46,979 INFO L229 MonitoredProcess]: Starting monitored process 43 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-23 16:04:46,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-23 16:04:46,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:04:46,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:46,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:46,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:46,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:46,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:46,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:46,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:46,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:47,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:47,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:47,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:47,005 INFO L229 MonitoredProcess]: Starting monitored process 44 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-23 16:04:47,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-23 16:04:47,006 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-23 16:04:47,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:47,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:47,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:47,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:47,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:47,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:47,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:47,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:47,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-23 16:04:47,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:47,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:47,030 INFO L229 MonitoredProcess]: Starting monitored process 45 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-23 16:04:47,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-23 16:04:47,035 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-23 16:04:47,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:47,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:47,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:47,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:47,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:47,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:47,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:47,042 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:47,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:47,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:47,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:47,059 INFO L229 MonitoredProcess]: Starting monitored process 46 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-23 16:04:47,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-23 16:04:47,061 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-23 16:04:47,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:47,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:47,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:47,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:47,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:47,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:47,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:47,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:47,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:47,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:47,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:47,085 INFO L229 MonitoredProcess]: Starting monitored process 47 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-23 16:04:47,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-23 16:04:47,087 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-23 16:04:47,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:47,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:47,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:47,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:47,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:47,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:47,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:47,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-23 16:04:47,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:47,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:47,113 INFO L229 MonitoredProcess]: Starting monitored process 48 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-23 16:04:47,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-23 16:04:47,114 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-23 16:04:47,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:47,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:47,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:47,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:47,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:47,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:47,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:47,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-07-23 16:04:47,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:47,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:47,140 INFO L229 MonitoredProcess]: Starting monitored process 49 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-23 16:04:47,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-23 16:04:47,142 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-23 16:04:47,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:47,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:47,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:47,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:47,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:47,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:47,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:47,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:47,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-23 16:04:47,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:47,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:47,166 INFO L229 MonitoredProcess]: Starting monitored process 50 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-23 16:04:47,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-23 16:04:47,168 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-23 16:04:47,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:47,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:47,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:47,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:47,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:47,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:47,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:47,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:47,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:47,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:47,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:47,192 INFO L229 MonitoredProcess]: Starting monitored process 51 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-23 16:04:47,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-23 16:04:47,194 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-23 16:04:47,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:47,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:47,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:47,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:47,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:47,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:47,210 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:47,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-23 16:04:47,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:47,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:47,228 INFO L229 MonitoredProcess]: Starting monitored process 52 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-23 16:04:47,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-23 16:04:47,229 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-23 16:04:47,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:47,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:47,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:47,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:47,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:47,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:47,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:47,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-23 16:04:47,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:47,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:47,258 INFO L229 MonitoredProcess]: Starting monitored process 53 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-23 16:04:47,263 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-23 16:04:47,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-23 16:04:47,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:47,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:47,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:47,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:47,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:47,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:47,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:47,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:47,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:47,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:47,290 INFO L229 MonitoredProcess]: Starting monitored process 54 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-23 16:04:47,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-23 16:04:47,291 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-23 16:04:47,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:47,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:47,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:47,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:47,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:47,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:47,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:47,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-07-23 16:04:47,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:47,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:47,329 INFO L229 MonitoredProcess]: Starting monitored process 55 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-23 16:04:47,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-23 16:04:47,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:04:47,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:47,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:47,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:47,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:47,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:47,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:47,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:47,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-07-23 16:04:47,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:47,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:47,358 INFO L229 MonitoredProcess]: Starting monitored process 56 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-23 16:04:47,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-23 16:04:47,370 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-23 16:04:47,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:47,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:47,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:47,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:47,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:47,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:47,401 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 16:04:47,446 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2022-07-23 16:04:47,446 INFO L444 ModelExtractionUtils]: 22 out of 58 variables were initially zero. Simplification set additionally 33 variables to zero. [2022-07-23 16:04:47,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:47,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:47,452 INFO L229 MonitoredProcess]: Starting monitored process 57 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-23 16:04:47,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-23 16:04:47,455 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 16:04:47,479 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 16:04:47,479 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 16:04:47,479 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_5, ULTIMATE.start_cstrcspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_5 - 1*ULTIMATE.start_cstrcspn_~s~0#1.offset Supporting invariants [] [2022-07-23 16:04:47,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:47,584 INFO L293 tatePredicateManager]: 32 out of 33 supporting invariants were superfluous and have been removed [2022-07-23 16:04:47,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:47,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 16:04:47,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:04:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:47,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 16:04:47,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:04:47,712 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-23 16:04:47,713 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-07-23 16:04:47,713 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 47 transitions. cyclomatic complexity: 16 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:47,761 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 47 transitions. cyclomatic complexity: 16. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 66 states and 84 transitions. Complement of second has 7 states. [2022-07-23 16:04:47,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-23 16:04:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-07-23 16:04:47,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 17 letters. Loop has 3 letters. [2022-07-23 16:04:47,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:47,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 20 letters. Loop has 3 letters. [2022-07-23 16:04:47,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:47,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 17 letters. Loop has 6 letters. [2022-07-23 16:04:47,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:47,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 84 transitions. [2022-07-23 16:04:47,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 16:04:47,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 49 states and 62 transitions. [2022-07-23 16:04:47,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 16:04:47,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 16:04:47,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 62 transitions. [2022-07-23 16:04:47,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 16:04:47,766 INFO L369 hiAutomatonCegarLoop]: Abstraction has 49 states and 62 transitions. [2022-07-23 16:04:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 62 transitions. [2022-07-23 16:04:47,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2022-07-23 16:04:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 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-23 16:04:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-23 16:04:47,768 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-23 16:04:47,768 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-23 16:04:47,768 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-23 16:04:47,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2022-07-23 16:04:47,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 16:04:47,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:47,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:47,768 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:04:47,768 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 16:04:47,772 INFO L752 eck$LassoCheckResult]: Stem: 1466#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1467#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, 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; 1473#L532 assume !(main_~length1~0#1 < 1); 1470#L532-2 assume !(main_~length2~0#1 < 1); 1464#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; 1465#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; 1484#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1485#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 1474#L541-4 main_~i~1#1 := 0; 1475#L547-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; 1468#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1469#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 1482#L547-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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 1483#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1486#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 1479#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 1490#L522-1 assume !cstrcspn_#t~short7#1; 1491#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 1471#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 1472#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 1480#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 1481#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1488#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 1477#L522-5 [2022-07-23 16:04:47,772 INFO L754 eck$LassoCheckResult]: Loop: 1477#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 1489#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 1476#L522-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 1477#L522-5 [2022-07-23 16:04:47,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:47,773 INFO L85 PathProgramCache]: Analyzing trace with hash -777149455, now seen corresponding path program 1 times [2022-07-23 16:04:47,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:47,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275138125] [2022-07-23 16:04:47,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:47,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 16:04:48,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:04:48,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275138125] [2022-07-23 16:04:48,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275138125] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:04:48,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989805325] [2022-07-23 16:04:48,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:48,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:04:48,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:48,089 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:04:48,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-07-23 16:04:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:48,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-23 16:04:48,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:04:48,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-23 16:04:48,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-23 16:04:48,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 16:04:48,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 16:04:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 16:04:48,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:04:48,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:48,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 16:04:48,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 16:04:48,499 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 16:04:48,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-23 16:04:48,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 16:04:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 16:04:48,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989805325] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:04:48,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:04:48,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 24 [2022-07-23 16:04:48,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049353691] [2022-07-23 16:04:48,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:04:48,730 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:04:48,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:48,731 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 4 times [2022-07-23 16:04:48,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:48,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694736727] [2022-07-23 16:04:48,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:48,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:48,740 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:48,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:48,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:04:48,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-23 16:04:48,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2022-07-23 16:04:48,840 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 25 states have internal predecessors, (55), 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-23 16:04:49,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:04:49,137 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-07-23 16:04:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 16:04:49,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2022-07-23 16:04:49,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 16:04:49,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 35 states and 44 transitions. [2022-07-23 16:04:49,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-23 16:04:49,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-23 16:04:49,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2022-07-23 16:04:49,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 16:04:49,139 INFO L369 hiAutomatonCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-07-23 16:04:49,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2022-07-23 16:04:49,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-07-23 16:04:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-07-23 16:04:49,141 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-07-23 16:04:49,141 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-07-23 16:04:49,141 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-23 16:04:49,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2022-07-23 16:04:49,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 16:04:49,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:49,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:49,142 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:04:49,142 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 16:04:49,142 INFO L752 eck$LassoCheckResult]: Stem: 1727#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1728#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, 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; 1732#L532 assume !(main_~length1~0#1 < 1); 1729#L532-2 assume !(main_~length2~0#1 < 1); 1723#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; 1724#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; 1743#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1744#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; 1745#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1755#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 1733#L541-4 main_~i~1#1 := 0; 1734#L547-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; 1725#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1726#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 1741#L547-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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 1742#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1746#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 1738#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 1750#L522-1 assume !cstrcspn_#t~short7#1; 1751#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 1730#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 1731#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 1739#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 1740#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1747#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 1736#L522-5 [2022-07-23 16:04:49,143 INFO L754 eck$LassoCheckResult]: Loop: 1736#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 1749#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 1735#L522-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 1736#L522-5 [2022-07-23 16:04:49,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:49,143 INFO L85 PathProgramCache]: Analyzing trace with hash 409245907, now seen corresponding path program 2 times [2022-07-23 16:04:49,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:49,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094729626] [2022-07-23 16:04:49,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:49,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:49,158 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:49,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:49,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:49,172 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 5 times [2022-07-23 16:04:49,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:49,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471000871] [2022-07-23 16:04:49,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:49,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:49,175 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:49,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:49,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:49,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1567281202, now seen corresponding path program 1 times [2022-07-23 16:04:49,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:49,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755848683] [2022-07-23 16:04:49,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:49,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 16:04:49,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:04:49,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755848683] [2022-07-23 16:04:49,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755848683] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:04:49,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208715287] [2022-07-23 16:04:49,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:49,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:04:49,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:49,243 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:04:49,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-07-23 16:04:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:49,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-23 16:04:49,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:04:49,383 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 16:04:49,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 16:04:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-23 16:04:49,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:04:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 16:04:49,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208715287] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:04:49,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:04:49,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 7] total 21 [2022-07-23 16:04:49,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034571062] [2022-07-23 16:04:49,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:04:49,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:04:49,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 16:04:49,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-07-23 16:04:49,668 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:04:50,037 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2022-07-23 16:04:50,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 16:04:50,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 140 transitions. [2022-07-23 16:04:50,039 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-23 16:04:50,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 93 states and 114 transitions. [2022-07-23 16:04:50,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-23 16:04:50,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-07-23 16:04:50,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 114 transitions. [2022-07-23 16:04:50,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 16:04:50,040 INFO L369 hiAutomatonCegarLoop]: Abstraction has 93 states and 114 transitions. [2022-07-23 16:04:50,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 114 transitions. [2022-07-23 16:04:50,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 38. [2022-07-23 16:04:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 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-23 16:04:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-07-23 16:04:50,042 INFO L392 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-07-23 16:04:50,042 INFO L374 stractBuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-07-23 16:04:50,042 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-23 16:04:50,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2022-07-23 16:04:50,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 16:04:50,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:50,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:50,044 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:04:50,044 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 16:04:50,044 INFO L752 eck$LassoCheckResult]: Stem: 2092#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2093#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, 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; 2099#L532 assume !(main_~length1~0#1 < 1); 2096#L532-2 assume !(main_~length2~0#1 < 1); 2090#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; 2091#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; 2110#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2111#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; 2112#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 2122#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 2100#L541-4 main_~i~1#1 := 0; 2101#L547-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; 2094#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 2095#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 2108#L547-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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 2109#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 2113#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 2124#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 2117#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 2118#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 2097#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 2098#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 2106#L519-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 2107#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 2114#L519-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 2103#L522-5 [2022-07-23 16:04:50,045 INFO L754 eck$LassoCheckResult]: Loop: 2103#L522-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 2116#L522-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 2102#L522-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 2103#L522-5 [2022-07-23 16:04:50,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1365761455, now seen corresponding path program 1 times [2022-07-23 16:04:50,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:50,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773008493] [2022-07-23 16:04:50,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:50,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:50,071 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:50,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:50,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:50,088 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 6 times [2022-07-23 16:04:50,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:50,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133373547] [2022-07-23 16:04:50,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:50,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:50,091 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:50,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:50,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:50,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1174254192, now seen corresponding path program 1 times [2022-07-23 16:04:50,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:50,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878765422] [2022-07-23 16:04:50,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:50,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:50,111 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:50,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:52,280 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:04:52,280 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:04:52,280 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:04:52,280 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:04:52,280 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:04:52,280 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:52,280 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:04:52,280 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:04:52,280 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration11_Lasso [2022-07-23 16:04:52,280 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:04:52,280 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:04:52,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:52,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:52,295 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-23 16:04:52,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:53,260 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-23 16:04:53,264 INFO L158 Benchmark]: Toolchain (without parser) took 21174.38ms. Allocated memory was 100.7MB in the beginning and 207.6MB in the end (delta: 107.0MB). Free memory was 62.9MB in the beginning and 115.8MB in the end (delta: -52.9MB). Peak memory consumption was 113.8MB. Max. memory is 16.1GB. [2022-07-23 16:04:53,265 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 16:04:53,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.46ms. Allocated memory is still 100.7MB. Free memory was 62.7MB in the beginning and 69.1MB in the end (delta: -6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 16:04:53,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.62ms. Allocated memory is still 100.7MB. Free memory was 69.1MB in the beginning and 67.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 16:04:53,265 INFO L158 Benchmark]: Boogie Preprocessor took 49.97ms. Allocated memory is still 100.7MB. Free memory was 67.0MB in the beginning and 65.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 16:04:53,265 INFO L158 Benchmark]: RCFGBuilder took 346.33ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 53.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-23 16:04:53,266 INFO L158 Benchmark]: BuchiAutomizer took 20330.98ms. Allocated memory was 100.7MB in the beginning and 207.6MB in the end (delta: 107.0MB). Free memory was 53.1MB in the beginning and 115.8MB in the end (delta: -62.8MB). Peak memory consumption was 107.9MB. Max. memory is 16.1GB. [2022-07-23 16:04:53,267 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.17ms. Allocated memory is still 100.7MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.46ms. Allocated memory is still 100.7MB. Free memory was 62.7MB in the beginning and 69.1MB in the end (delta: -6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.62ms. Allocated memory is still 100.7MB. Free memory was 69.1MB in the beginning and 67.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.97ms. Allocated memory is still 100.7MB. Free memory was 67.0MB in the beginning and 65.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 346.33ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 53.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 20330.98ms. Allocated memory was 100.7MB in the beginning and 207.6MB in the end (delta: 107.0MB). Free memory was 53.1MB in the beginning and 115.8MB in the end (delta: -62.8MB). Peak memory consumption was 107.9MB. 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-23 16:04:53,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-07-23 16:04:53,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:53,680 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