./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/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-?-6c24879 [2022-07-13 04:53:07,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:53:07,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:53:07,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:53:07,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:53:07,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:53:07,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:53:07,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:53:07,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:53:07,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:53:07,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:53:07,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:53:07,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:53:07,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:53:07,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:53:07,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:53:07,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:53:07,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:53:07,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:53:07,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:53:07,476 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:53:07,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:53:07,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:53:07,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:53:07,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:53:07,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:53:07,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:53:07,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:53:07,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:53:07,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:53:07,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:53:07,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:53:07,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:53:07,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:53:07,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:53:07,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:53:07,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:53:07,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:53:07,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:53:07,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:53:07,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:53:07,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:53:07,496 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:53:07,531 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:53:07,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:53:07,532 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:53:07,532 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:53:07,534 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:53:07,534 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:53:07,534 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:53:07,534 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:53:07,535 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:53:07,535 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:53:07,535 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:53:07,536 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:53:07,536 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:53:07,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:53:07,536 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:53:07,536 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:53:07,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:53:07,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:53:07,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:53:07,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:53:07,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:53:07,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:53:07,539 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:53:07,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:53:07,539 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:53:07,539 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:53:07,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:53:07,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:53:07,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:53:07,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:53:07,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:53:07,542 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:53:07,542 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-13 04:53:07,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:53:07,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:53:07,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:53:07,839 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:53:07,840 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:53:07,841 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-13 04:53:07,900 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/335d4bf07/6605b276343e431798918038ca178c03/FLAGf245aa4ff [2022-07-13 04:53:08,422 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:53:08,423 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2022-07-13 04:53:08,436 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/335d4bf07/6605b276343e431798918038ca178c03/FLAGf245aa4ff [2022-07-13 04:53:08,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/335d4bf07/6605b276343e431798918038ca178c03 [2022-07-13 04:53:08,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:53:08,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:53:08,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:53:08,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:53:08,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:53:08,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:53:08" (1/1) ... [2022-07-13 04:53:08,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28db394d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:08, skipping insertion in model container [2022-07-13 04:53:08,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:53:08" (1/1) ... [2022-07-13 04:53:08,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:53:08,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:53:09,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:53:09,210 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:53:09,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:53:09,284 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:53:09,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:09 WrapperNode [2022-07-13 04:53:09,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:53:09,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:53:09,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:53:09,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:53:09,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:09" (1/1) ... [2022-07-13 04:53:09,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:09" (1/1) ... [2022-07-13 04:53:09,355 INFO L137 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2022-07-13 04:53:09,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:53:09,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:53:09,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:53:09,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:53:09,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:09" (1/1) ... [2022-07-13 04:53:09,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:09" (1/1) ... [2022-07-13 04:53:09,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:09" (1/1) ... [2022-07-13 04:53:09,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:09" (1/1) ... [2022-07-13 04:53:09,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:09" (1/1) ... [2022-07-13 04:53:09,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:09" (1/1) ... [2022-07-13 04:53:09,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:09" (1/1) ... [2022-07-13 04:53:09,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:53:09,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:53:09,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:53:09,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:53:09,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:09" (1/1) ... [2022-07-13 04:53:09,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:09,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:09,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:09,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 04:53:09,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 04:53:09,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 04:53:09,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 04:53:09,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 04:53:09,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:53:09,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:53:09,610 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:53:09,620 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:53:09,850 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:53:09,855 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:53:09,863 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 04:53:09,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:53:09 BoogieIcfgContainer [2022-07-13 04:53:09,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:53:09,866 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:53:09,866 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:53:09,869 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:53:09,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:53:09,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:53:08" (1/3) ... [2022-07-13 04:53:09,871 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@675754dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:53:09, skipping insertion in model container [2022-07-13 04:53:09,872 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:53:09,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:09" (2/3) ... [2022-07-13 04:53:09,872 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@675754dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:53:09, skipping insertion in model container [2022-07-13 04:53:09,872 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:53:09,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:53:09" (3/3) ... [2022-07-13 04:53:09,874 INFO L354 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca-1.i [2022-07-13 04:53:09,931 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:53:09,931 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:53:09,932 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:53:09,932 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:53:09,932 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:53:09,932 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:53:09,932 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:53:09,932 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:53:09,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:09,958 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-07-13 04:53:09,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:09,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:09,966 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 04:53:09,966 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:53:09,966 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:53:09,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:09,971 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-07-13 04:53:09,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:09,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:09,972 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 04:53:09,972 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:53:09,978 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-13 04:53:09,979 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-13 04:53:09,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-07-13 04:53:10,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:10,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415309122] [2022-07-13 04:53:10,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:10,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:10,111 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:10,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:10,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:10,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-07-13 04:53:10,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:10,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749347324] [2022-07-13 04:53:10,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:10,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:10,177 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:10,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:10,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:10,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-07-13 04:53:10,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:10,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940753291] [2022-07-13 04:53:10,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:10,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:10,233 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:10,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:10,645 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:53:10,646 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:53:10,646 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:53:10,646 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:53:10,646 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:53:10,646 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:10,647 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:53:10,647 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:53:10,647 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration1_Lasso [2022-07-13 04:53:10,647 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:53:10,647 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:53:10,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:10,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:10,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:10,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:10,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:10,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:10,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:10,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:10,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:10,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:10,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:10,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:10,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:10,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:10,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:11,138 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:53:11,142 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:53:11,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:11,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:11,151 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:11,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:11,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:11,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:11,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:11,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:11,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:11,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:11,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 04:53:11,200 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:11,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:11,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:11,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:11,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:11,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:11,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:11,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:11,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:11,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:11,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:11,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:11,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-13 04:53:11,257 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:11,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:11,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:11,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:11,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:11,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-13 04:53:11,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:11,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:11,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:11,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:11,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:11,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:11,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:11,335 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:53:11,356 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-13 04:53:11,357 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-13 04:53:11,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:11,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:11,393 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:11,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-13 04:53:11,395 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:53:11,417 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-13 04:53:11,417 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:53:11,417 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [1*ULTIMATE.start_main_~nondetString1~0#1.offset >= 0] [2022-07-13 04:53:11,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:11,461 INFO L293 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2022-07-13 04:53:11,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:11,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:53:11,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:11,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 04:53:11,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:53:11,619 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-13 04:53:11,621 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:11,707 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 87 transitions. Complement of second has 7 states. [2022-07-13 04:53:11,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 04:53:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-07-13 04:53:11,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-13 04:53:11,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:11,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-13 04:53:11,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:11,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-13 04:53:11,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:11,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. [2022-07-13 04:53:11,722 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-13 04:53:11,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 27 transitions. [2022-07-13 04:53:11,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-13 04:53:11,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-13 04:53:11,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2022-07-13 04:53:11,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:11,729 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-13 04:53:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2022-07-13 04:53:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 04:53:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-07-13 04:53:11,751 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-13 04:53:11,752 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-13 04:53:11,752 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:53:11,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2022-07-13 04:53:11,754 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-13 04:53:11,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:11,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:11,755 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:11,755 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:53:11,755 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-13 04:53:11,756 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-13 04:53:11,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:11,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-07-13 04:53:11,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:11,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121541480] [2022-07-13 04:53:11,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:11,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:11,773 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:11,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:11,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-07-13 04:53:11,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:11,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793978447] [2022-07-13 04:53:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:11,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:11,813 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:11,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:11,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:11,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-07-13 04:53:11,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:11,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020474262] [2022-07-13 04:53:11,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:11,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:11,833 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:11,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:12,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:12,136 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:53:12,136 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:53:12,137 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:53:12,137 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:53:12,137 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:53:12,137 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:12,137 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:53:12,137 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:53:12,137 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration2_Lasso [2022-07-13 04:53:12,137 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:53:12,137 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:53:12,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:12,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:12,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:12,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:12,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:12,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:12,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:12,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:12,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:12,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:12,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:12,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:12,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:12,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:12,549 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:53:12,549 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:53:12,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:12,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:12,555 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:12,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 04:53:12,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:12,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:12,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:12,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:12,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:12,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:12,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:12,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:12,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:12,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:12,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:12,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:12,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:12,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-13 04:53:12,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:12,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:12,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:12,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:12,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:12,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:12,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:12,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:12,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:12,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:12,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:12,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:12,622 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:12,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-13 04:53:12,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:12,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:12,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:12,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:12,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:12,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:12,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:12,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:12,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:12,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:12,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:12,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:12,704 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:12,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-13 04:53:12,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:12,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:12,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:12,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:12,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:12,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:12,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:12,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:12,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:12,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:12,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:12,745 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:12,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-13 04:53:12,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:12,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:12,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:12,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:12,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:12,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:12,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:12,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:12,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:12,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:12,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:12,818 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:12,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-13 04:53:12,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:12,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:12,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:12,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:12,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:12,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:12,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:12,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:12,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:12,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-07-13 04:53:12,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:12,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:12,848 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:12,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-13 04:53:12,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:12,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:12,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:12,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:12,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:12,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:12,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:12,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:12,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-13 04:53:12,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:12,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:12,891 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:12,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 04:53:12,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:12,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:12,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:12,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:12,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:12,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:12,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:12,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:12,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:12,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:12,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:12,956 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:12,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:12,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:12,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:12,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:12,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:12,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:12,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:12,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:12,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-13 04:53:12,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:13,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:13,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:13,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:13,023 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:13,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:13,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:13,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:13,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:13,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:13,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-13 04:53:13,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:13,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:13,081 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:53:13,101 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-13 04:53:13,102 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-13 04:53:13,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:13,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:13,104 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:13,114 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:53:13,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-13 04:53:13,132 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-13 04:53:13,133 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:53:13,133 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_2, ULTIMATE.start_main_~i~1#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_2 - 1*ULTIMATE.start_main_~i~1#1 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-13 04:53:13,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:13,176 INFO L293 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2022-07-13 04:53:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:13,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:53:13,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:13,278 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 04:53:13,279 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-13 04:53:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:13,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 04:53:13,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:53:13,316 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-13 04:53:13,316 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-13 04:53:13,359 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-13 04:53:13,360 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-13 04:53:13,360 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-13 04:53:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-07-13 04:53:13,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-13 04:53:13,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:13,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-13 04:53:13,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:13,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-13 04:53:13,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:13,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2022-07-13 04:53:13,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 04:53:13,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2022-07-13 04:53:13,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-13 04:53:13,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-13 04:53:13,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2022-07-13 04:53:13,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:13,364 INFO L369 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-07-13 04:53:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2022-07-13 04:53:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-13 04:53:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2022-07-13 04:53:13,367 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-07-13 04:53:13,367 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-07-13 04:53:13,367 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:53:13,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2022-07-13 04:53:13,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 04:53:13,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:13,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:13,368 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:13,368 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:13,369 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-13 04:53:13,369 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-13 04:53:13,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:13,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2022-07-13 04:53:13,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:13,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004329016] [2022-07-13 04:53:13,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:13,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:13,386 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:13,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:13,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:13,401 INFO L85 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 1 times [2022-07-13 04:53:13,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:13,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710015136] [2022-07-13 04:53:13,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:13,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:13,411 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:13,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:13,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1903570310, now seen corresponding path program 1 times [2022-07-13 04:53:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:13,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109911010] [2022-07-13 04:53:13,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:13,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:53:13,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:53:13,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109911010] [2022-07-13 04:53:13,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109911010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:53:13,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:53:13,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 04:53:13,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681994072] [2022-07-13 04:53:13,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:53:13,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:53:13,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 04:53:13,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-13 04:53:13,760 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:53:13,884 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-07-13 04:53:13,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 04:53:13,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2022-07-13 04:53:13,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-13 04:53:13,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 42 transitions. [2022-07-13 04:53:13,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-13 04:53:13,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-13 04:53:13,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2022-07-13 04:53:13,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:13,887 INFO L369 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-13 04:53:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2022-07-13 04:53:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-07-13 04:53:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-13 04:53:13,889 INFO L392 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-13 04:53:13,889 INFO L374 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-13 04:53:13,889 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:53:13,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2022-07-13 04:53:13,890 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-13 04:53:13,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:13,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:13,890 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:13,890 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:13,890 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-13 04:53:13,891 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-13 04:53:13,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:13,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 2 times [2022-07-13 04:53:13,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:13,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899873810] [2022-07-13 04:53:13,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:13,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:13,905 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:13,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:13,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:13,943 INFO L85 PathProgramCache]: Analyzing trace with hash -903038413, now seen corresponding path program 1 times [2022-07-13 04:53:13,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:13,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831266931] [2022-07-13 04:53:13,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:13,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:13,950 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:13,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:13,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:13,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:13,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1905417352, now seen corresponding path program 1 times [2022-07-13 04:53:13,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:13,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340478084] [2022-07-13 04:53:13,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:13,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:53:14,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:53:14,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340478084] [2022-07-13 04:53:14,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340478084] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:53:14,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:53:14,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 04:53:14,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280429419] [2022-07-13 04:53:14,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:53:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:53:14,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 04:53:14,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 04:53:14,293 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-13 04:53:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:53:14,557 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-07-13 04:53:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 04:53:14,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 80 transitions. [2022-07-13 04:53:14,560 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2022-07-13 04:53:14,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 61 states and 75 transitions. [2022-07-13 04:53:14,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-13 04:53:14,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-13 04:53:14,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 75 transitions. [2022-07-13 04:53:14,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:14,561 INFO L369 hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions. [2022-07-13 04:53:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 75 transitions. [2022-07-13 04:53:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 40. [2022-07-13 04:53:14,565 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-13 04:53:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-07-13 04:53:14,565 INFO L392 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-07-13 04:53:14,565 INFO L374 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-07-13 04:53:14,566 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 04:53:14,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2022-07-13 04:53:14,566 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-13 04:53:14,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:14,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:14,567 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:14,567 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:14,567 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-13 04:53:14,568 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-13 04:53:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2022-07-13 04:53:14,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:14,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917385179] [2022-07-13 04:53:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:14,580 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:14,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:14,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:14,591 INFO L85 PathProgramCache]: Analyzing trace with hash -903038413, now seen corresponding path program 2 times [2022-07-13 04:53:14,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:14,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878726559] [2022-07-13 04:53:14,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:14,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:14,597 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:14,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:14,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:14,601 INFO L85 PathProgramCache]: Analyzing trace with hash -162323734, now seen corresponding path program 1 times [2022-07-13 04:53:14,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:14,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334869351] [2022-07-13 04:53:14,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:14,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:14,616 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:14,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:15,287 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:53:15,287 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:53:15,287 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:53:15,287 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:53:15,287 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:53:15,288 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:15,288 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:53:15,288 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:53:15,288 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration5_Lasso [2022-07-13 04:53:15,288 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:53:15,288 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:53:15,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,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-13 04:53:15,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-13 04:53:15,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:15,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:16,306 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:53:16,307 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:53:16,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:16,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:16,311 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:16,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-13 04:53:16,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:16,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:16,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:16,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:16,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:16,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:16,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:16,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:16,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:16,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:16,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:16,376 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:16,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-13 04:53:16,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:16,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:16,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:16,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:16,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:16,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:16,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:16,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:16,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:16,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:16,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:16,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:16,405 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:16,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-13 04:53:16,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:16,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:16,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:16,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:16,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:16,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:16,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:16,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:16,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:16,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:16,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:16,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:16,434 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:16,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-13 04:53:16,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:16,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:16,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:16,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:16,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:16,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:16,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:16,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:16,506 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-13 04:53:16,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:16,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:16,508 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:16,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:16,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:16,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:16,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:16,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:16,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:16,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:16,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:16,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-13 04:53:16,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:16,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:16,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:16,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:16,550 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:16,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-13 04:53:16,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-13 04:53:16,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:16,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:16,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:16,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:16,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:16,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:16,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:16,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-13 04:53:16,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:16,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:16,579 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:16,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-13 04:53:16,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:16,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:16,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:16,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:16,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:16,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:16,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:16,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:16,597 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:16,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-13 04:53:16,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:16,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:16,614 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:16,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-13 04:53:16,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:16,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:16,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:16,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:16,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:16,629 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:16,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:16,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:16,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-13 04:53:16,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:16,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:16,648 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:16,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-13 04:53:16,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:16,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:16,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:16,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:16,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:16,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:16,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:16,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:16,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:16,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:16,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:16,677 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:16,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-13 04:53:16,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:16,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:16,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:16,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:16,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:16,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:16,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:16,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:16,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:16,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:16,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:16,728 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:16,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-13 04:53:16,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:16,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:16,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:16,736 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:53:16,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:16,741 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-13 04:53:16,741 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-13 04:53:16,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:16,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-13 04:53:16,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:16,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:16,777 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:16,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-13 04:53:16,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:16,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:16,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:16,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:16,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:16,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:16,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:16,823 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:53:16,859 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-07-13 04:53:16,860 INFO L444 ModelExtractionUtils]: 45 out of 61 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-07-13 04:53:16,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:16,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:16,873 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:16,876 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:53:16,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-13 04:53:16,886 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 04:53:16,886 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:53:16,886 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3, ULTIMATE.start_cstrcspn_~sc1~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3 - 1*ULTIMATE.start_cstrcspn_~sc1~0#1.offset Supporting invariants [] [2022-07-13 04:53:16,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:16,942 INFO L293 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2022-07-13 04:53:16,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:16,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 04:53:16,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:17,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 04:53:17,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:53:17,070 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-13 04:53:17,071 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-13 04:53:17,103 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-13 04:53:17,104 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-13 04:53:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-07-13 04:53:17,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 8 letters. [2022-07-13 04:53:17,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:17,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 19 letters. Loop has 8 letters. [2022-07-13 04:53:17,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:17,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 16 letters. [2022-07-13 04:53:17,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:17,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 74 transitions. [2022-07-13 04:53:17,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 04:53:17,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 39 states and 50 transitions. [2022-07-13 04:53:17,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-13 04:53:17,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-13 04:53:17,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2022-07-13 04:53:17,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:53:17,108 INFO L369 hiAutomatonCegarLoop]: Abstraction has 39 states and 50 transitions. [2022-07-13 04:53:17,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2022-07-13 04:53:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-07-13 04:53:17,110 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-13 04:53:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-07-13 04:53:17,111 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-07-13 04:53:17,111 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-07-13 04:53:17,111 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 04:53:17,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2022-07-13 04:53:17,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 04:53:17,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:17,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:17,112 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:17,112 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 04:53:17,113 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-13 04:53:17,113 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-13 04:53:17,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:17,113 INFO L85 PathProgramCache]: Analyzing trace with hash -534376483, now seen corresponding path program 1 times [2022-07-13 04:53:17,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:17,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904107900] [2022-07-13 04:53:17,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:17,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 04:53:17,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:53:17,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904107900] [2022-07-13 04:53:17,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904107900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:53:17,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:53:17,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 04:53:17,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116102919] [2022-07-13 04:53:17,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:53:17,211 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:53:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 1 times [2022-07-13 04:53:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:17,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648660501] [2022-07-13 04:53:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:17,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:17,217 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:17,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:17,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:53:17,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 04:53:17,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 04:53:17,310 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-13 04:53:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:53:17,369 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-07-13 04:53:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 04:53:17,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2022-07-13 04:53:17,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 04:53:17,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 28 states and 36 transitions. [2022-07-13 04:53:17,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-13 04:53:17,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-13 04:53:17,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2022-07-13 04:53:17,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:53:17,372 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-07-13 04:53:17,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2022-07-13 04:53:17,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-13 04:53:17,373 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-13 04:53:17,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-07-13 04:53:17,374 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-13 04:53:17,374 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-13 04:53:17,374 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 04:53:17,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2022-07-13 04:53:17,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 04:53:17,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:17,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:17,376 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:17,376 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 04:53:17,376 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-13 04:53:17,376 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-13 04:53:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:17,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2055034687, now seen corresponding path program 1 times [2022-07-13 04:53:17,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:17,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186849331] [2022-07-13 04:53:17,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:17,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:17,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:17,429 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:17,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:17,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:17,442 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 2 times [2022-07-13 04:53:17,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:17,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438966384] [2022-07-13 04:53:17,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:17,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:17,447 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:17,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:17,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:17,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1074579938, now seen corresponding path program 1 times [2022-07-13 04:53:17,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:17,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99345581] [2022-07-13 04:53:17,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:17,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:17,465 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:17,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:18,433 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:53:18,434 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:53:18,434 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:53:18,434 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:53:18,434 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:53:18,434 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:18,434 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:53:18,434 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:53:18,434 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration7_Lasso [2022-07-13 04:53:18,434 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:53:18,434 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:53:18,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:18,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:18,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:18,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:18,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:18,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:18,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:19,826 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:53:19,827 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:53:19,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:19,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:19,832 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:19,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-13 04:53:19,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:19,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:19,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:19,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:19,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:19,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:19,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:19,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:19,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:19,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:19,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:19,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:19,860 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:19,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:19,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-13 04:53:19,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:19,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:19,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:19,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:19,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:19,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:19,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:19,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:19,892 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-13 04:53:19,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:19,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:19,894 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:19,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-13 04:53:19,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:19,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:19,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:19,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:19,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:19,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:19,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:19,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:19,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:19,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:19,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:19,922 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:19,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-13 04:53:19,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:19,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:19,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:19,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:19,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:19,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:19,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:19,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:19,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:19,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:19,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:19,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:19,948 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:19,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-13 04:53:19,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:19,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:19,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:19,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:19,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:19,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:19,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:19,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:19,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:19,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-13 04:53:19,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:19,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:19,975 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:19,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-13 04:53:19,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:19,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:19,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:19,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:19,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:19,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:19,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:19,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:19,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:20,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-13 04:53:20,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:20,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:20,001 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:20,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:20,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-13 04:53:20,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:20,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:20,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:20,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:20,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:20,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:20,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:20,035 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-13 04:53:20,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:20,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:20,037 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:20,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-13 04:53:20,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:20,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:20,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:20,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:20,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:20,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:20,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:20,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:20,066 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-13 04:53:20,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:20,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:20,068 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:20,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-13 04:53:20,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:20,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:20,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:20,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:20,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:20,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:20,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:20,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:20,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-13 04:53:20,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:20,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:20,122 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:20,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-13 04:53:20,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:20,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:20,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:20,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:20,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:20,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:20,132 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:20,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:20,152 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-13 04:53:20,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:20,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:20,153 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:20,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-13 04:53:20,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:20,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:20,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:20,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:20,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:20,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:20,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:20,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:20,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-13 04:53:20,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:20,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:20,184 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:20,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-13 04:53:20,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:20,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:20,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:20,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:20,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:20,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:20,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:20,219 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:53:20,260 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-13 04:53:20,260 INFO L444 ModelExtractionUtils]: 19 out of 58 variables were initially zero. Simplification set additionally 36 variables to zero. [2022-07-13 04:53:20,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:20,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:20,263 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-13 04:53:20,265 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-13 04:53:20,267 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:53:20,304 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 04:53:20,304 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:53:20,304 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_4, ULTIMATE.start_cstrcspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_4 - 1*ULTIMATE.start_cstrcspn_~s~0#1.offset Supporting invariants [] [2022-07-13 04:53:20,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:20,420 INFO L293 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2022-07-13 04:53:20,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:20,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 04:53:20,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:20,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 04:53:20,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:53:20,556 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-13 04:53:20,556 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 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-13 04:53:20,597 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. 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 54 states and 67 transitions. Complement of second has 7 states. [2022-07-13 04:53:20,599 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-13 04:53:20,599 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-13 04:53:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-07-13 04:53:20,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 3 letters. [2022-07-13 04:53:20,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:20,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 18 letters. Loop has 3 letters. [2022-07-13 04:53:20,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:20,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 6 letters. [2022-07-13 04:53:20,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:20,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 67 transitions. [2022-07-13 04:53:20,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 04:53:20,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 40 states and 50 transitions. [2022-07-13 04:53:20,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-13 04:53:20,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-13 04:53:20,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 50 transitions. [2022-07-13 04:53:20,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:53:20,602 INFO L369 hiAutomatonCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-07-13 04:53:20,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 50 transitions. [2022-07-13 04:53:20,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2022-07-13 04:53:20,605 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-13 04:53:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-13 04:53:20,606 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-13 04:53:20,606 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-13 04:53:20,606 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 04:53:20,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2022-07-13 04:53:20,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 04:53:20,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:20,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:20,607 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-13 04:53:20,607 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 04:53:20,607 INFO L752 eck$LassoCheckResult]: Stem: 1104#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1105#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; 1111#L532 assume !(main_~length1~0#1 < 1); 1108#L532-2 assume !(main_~length2~0#1 < 1); 1102#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; 1103#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; 1121#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1122#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 1112#L541-4 main_~i~1#1 := 0; 1113#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; 1106#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1107#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 1119#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; 1120#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1123#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; 1131#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; 1127#L522-1 assume !cstrcspn_#t~short7#1; 1116#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 1109#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 1110#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 1117#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; 1118#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1125#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; 1115#L522-5 [2022-07-13 04:53:20,607 INFO L754 eck$LassoCheckResult]: Loop: 1115#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; 1126#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); 1114#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; 1115#L522-5 [2022-07-13 04:53:20,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:20,608 INFO L85 PathProgramCache]: Analyzing trace with hash -777149455, now seen corresponding path program 1 times [2022-07-13 04:53:20,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:20,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146784446] [2022-07-13 04:53:20,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:20,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:20,764 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-13 04:53:20,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:53:20,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146784446] [2022-07-13 04:53:20,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146784446] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 04:53:20,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282413496] [2022-07-13 04:53:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:20,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 04:53:20,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:20,766 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 04:53:20,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-07-13 04:53:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:20,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-13 04:53:20,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:20,865 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-13 04:53:20,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:20,983 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-13 04:53:20,993 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-13 04:53:21,088 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-13 04:53:21,089 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-13 04:53:21,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 04:53:21,126 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 04:53:21,127 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-13 04:53:21,133 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 04:53:21,133 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-13 04:53:21,138 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-13 04:53:21,243 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-13 04:53:21,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282413496] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 04:53:21,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 04:53:21,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-07-13 04:53:21,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826456997] [2022-07-13 04:53:21,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 04:53:21,244 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:53:21,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:21,244 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 3 times [2022-07-13 04:53:21,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:21,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129769991] [2022-07-13 04:53:21,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:21,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:21,259 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:21,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:21,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:53:21,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 04:53:21,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-07-13 04:53:21,348 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:53:21,586 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-07-13 04:53:21,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 04:53:21,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2022-07-13 04:53:21,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 04:53:21,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 35 states and 44 transitions. [2022-07-13 04:53:21,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-13 04:53:21,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-13 04:53:21,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2022-07-13 04:53:21,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:53:21,589 INFO L369 hiAutomatonCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-07-13 04:53:21,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2022-07-13 04:53:21,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-07-13 04:53:21,591 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-13 04:53:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-07-13 04:53:21,591 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-07-13 04:53:21,592 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-07-13 04:53:21,592 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-13 04:53:21,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2022-07-13 04:53:21,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 04:53:21,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:21,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:21,593 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-13 04:53:21,593 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 04:53:21,593 INFO L752 eck$LassoCheckResult]: Stem: 1355#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1356#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; 1362#L532 assume !(main_~length1~0#1 < 1); 1359#L532-2 assume !(main_~length2~0#1 < 1); 1353#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; 1354#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; 1373#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1374#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; 1375#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1384#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 1363#L541-4 main_~i~1#1 := 0; 1364#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; 1357#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1358#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 1371#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; 1372#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1376#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; 1368#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; 1380#L522-1 assume !cstrcspn_#t~short7#1; 1381#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 1360#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 1361#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 1369#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; 1370#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1378#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; 1366#L522-5 [2022-07-13 04:53:21,593 INFO L754 eck$LassoCheckResult]: Loop: 1366#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; 1379#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); 1365#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; 1366#L522-5 [2022-07-13 04:53:21,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:21,594 INFO L85 PathProgramCache]: Analyzing trace with hash 409245907, now seen corresponding path program 2 times [2022-07-13 04:53:21,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:21,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850264298] [2022-07-13 04:53:21,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:21,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:21,621 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:21,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:21,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:21,637 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 4 times [2022-07-13 04:53:21,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:21,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811800061] [2022-07-13 04:53:21,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:21,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:21,642 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:21,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:21,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:21,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1567281202, now seen corresponding path program 1 times [2022-07-13 04:53:21,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:21,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673847773] [2022-07-13 04:53:21,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:21,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:21,720 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-13 04:53:21,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:53:21,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673847773] [2022-07-13 04:53:21,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673847773] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 04:53:21,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768001735] [2022-07-13 04:53:21,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:21,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 04:53:21,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:21,724 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 04:53:21,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-07-13 04:53:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:21,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 04:53:21,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:21,823 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 04:53:21,824 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-13 04:53:21,867 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-13 04:53:21,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 04:53:21,905 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-13 04:53:21,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768001735] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 04:53:21,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 04:53:21,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2022-07-13 04:53:21,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368233356] [2022-07-13 04:53:21,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 04:53:21,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:53:21,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 04:53:21,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-13 04:53:21,991 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:22,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:53:22,086 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-07-13 04:53:22,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 04:53:22,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2022-07-13 04:53:22,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 04:53:22,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 52 states and 64 transitions. [2022-07-13 04:53:22,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-07-13 04:53:22,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-13 04:53:22,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 64 transitions. [2022-07-13 04:53:22,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:53:22,088 INFO L369 hiAutomatonCegarLoop]: Abstraction has 52 states and 64 transitions. [2022-07-13 04:53:22,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 64 transitions. [2022-07-13 04:53:22,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2022-07-13 04:53:22,090 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-13 04:53:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-07-13 04:53:22,090 INFO L392 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-07-13 04:53:22,090 INFO L374 stractBuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-07-13 04:53:22,090 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-13 04:53:22,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2022-07-13 04:53:22,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-13 04:53:22,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:22,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:22,092 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-13 04:53:22,092 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 04:53:22,092 INFO L752 eck$LassoCheckResult]: Stem: 1634#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1635#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; 1641#L532 assume !(main_~length1~0#1 < 1); 1638#L532-2 assume !(main_~length2~0#1 < 1); 1632#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; 1633#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; 1652#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1653#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; 1654#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1664#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 1642#L541-4 main_~i~1#1 := 0; 1643#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; 1636#L547-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1637#L547-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 1650#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; 1651#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1655#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; 1666#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; 1659#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); 1660#L522-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 1639#L522-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 1640#L524 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 1648#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; 1649#L519-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 1657#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; 1645#L522-5 [2022-07-13 04:53:22,093 INFO L754 eck$LassoCheckResult]: Loop: 1645#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; 1658#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); 1644#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; 1645#L522-5 [2022-07-13 04:53:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:22,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1365761455, now seen corresponding path program 1 times [2022-07-13 04:53:22,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:22,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213210013] [2022-07-13 04:53:22,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:22,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:22,110 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:22,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:22,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:22,126 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 5 times [2022-07-13 04:53:22,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:22,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169655119] [2022-07-13 04:53:22,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:22,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:22,130 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:22,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:22,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:22,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1174254192, now seen corresponding path program 1 times [2022-07-13 04:53:22,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:22,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759346072] [2022-07-13 04:53:22,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:22,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:22,161 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:22,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:24,252 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:53:24,253 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:53:24,253 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:53:24,253 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:53:24,253 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:53:24,253 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:24,253 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:53:24,253 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:53:24,253 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-1.i_Iteration10_Lasso [2022-07-13 04:53:24,253 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:53:24,253 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:53:24,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:24,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:24,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:25,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:27,288 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:53:27,289 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:53:27,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:27,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:27,293 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-13 04:53:27,294 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-13 04:53:27,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:27,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:27,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:27,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:27,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:27,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:27,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:27,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:27,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:27,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-13 04:53:27,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:27,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:27,319 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-13 04:53:27,322 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-13 04:53:27,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:27,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:27,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:27,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:27,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:27,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:27,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:27,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:27,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:27,345 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-13 04:53:27,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:27,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:27,346 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-13 04:53:27,347 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-13 04:53:27,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:27,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:27,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:27,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:27,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:27,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:27,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:27,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:27,376 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-13 04:53:27,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:27,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:27,377 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-13 04:53:27,378 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-13 04:53:27,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:27,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:27,387 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2022-07-13 04:53:27,387 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2022-07-13 04:53:27,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:27,578 INFO L401 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2022-07-13 04:53:27,578 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2022-07-13 04:53:27,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:28,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:28,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:28,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:28,002 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-13 04:53:28,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:28,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:28,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:28,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:28,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:28,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:28,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:28,020 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-13 04:53:28,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:28,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:28,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:28,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:28,056 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-13 04:53:28,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:28,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:28,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:28,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:28,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:28,067 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-13 04:53:28,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:28,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:28,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:28,111 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-13 04:53:28,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:28,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:28,112 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-13 04:53:28,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:28,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:28,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:28,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:28,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:28,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:28,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:28,127 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-13 04:53:28,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:28,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:28,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:28,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:28,160 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-13 04:53:28,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:28,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:28,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:28,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:28,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:28,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:28,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:28,190 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-13 04:53:28,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:28,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:28,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:28,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:28,221 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-13 04:53:28,223 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-13 04:53:28,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:28,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:28,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:28,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:28,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:28,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:28,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:28,271 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:53:28,377 INFO L443 ModelExtractionUtils]: Simplification made 42 calls to the SMT solver. [2022-07-13 04:53:28,378 INFO L444 ModelExtractionUtils]: 8 out of 64 variables were initially zero. Simplification set additionally 53 variables to zero. [2022-07-13 04:53:28,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:28,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:28,383 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-13 04:53:28,388 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:53:28,395 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-13 04:53:28,409 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 04:53:28,409 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:53:28,410 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-13 04:53:28,435 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-13 04:53:28,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:28,706 INFO L293 tatePredicateManager]: 56 out of 57 supporting invariants were superfluous and have been removed [2022-07-13 04:53:28,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:28,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 04:53:28,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:28,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 04:53:28,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:53:28,850 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-13 04:53:28,850 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:28,907 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 70 transitions. Complement of second has 7 states. [2022-07-13 04:53:28,911 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-13 04:53:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-07-13 04:53:28,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 25 letters. Loop has 3 letters. [2022-07-13 04:53:28,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:28,916 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 04:53:28,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:28,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 04:53:28,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:29,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 04:53:29,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:53:29,079 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2022-07-13 04:53:29,079 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:29,136 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 70 transitions. Complement of second has 7 states. [2022-07-13 04:53:29,137 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-13 04:53:29,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-07-13 04:53:29,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 25 letters. Loop has 3 letters. [2022-07-13 04:53:29,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:29,139 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 04:53:29,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:29,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 04:53:29,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:29,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 04:53:29,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:53:29,283 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-07-13 04:53:29,283 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:29,323 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 55 states and 72 transitions. Complement of second has 6 states. [2022-07-13 04:53:29,323 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-13 04:53:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-07-13 04:53:29,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 25 letters. Loop has 3 letters. [2022-07-13 04:53:29,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:29,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 28 letters. Loop has 3 letters. [2022-07-13 04:53:29,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:29,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 25 letters. Loop has 6 letters. [2022-07-13 04:53:29,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:29,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 72 transitions. [2022-07-13 04:53:29,330 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 04:53:29,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2022-07-13 04:53:29,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-13 04:53:29,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-13 04:53:29,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-13 04:53:29,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:29,330 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 04:53:29,331 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 04:53:29,331 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 04:53:29,331 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-13 04:53:29,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-13 04:53:29,331 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 04:53:29,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-13 04:53:29,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 04:53:29 BoogieIcfgContainer [2022-07-13 04:53:29,336 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 04:53:29,337 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 04:53:29,337 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 04:53:29,337 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 04:53:29,337 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:53:09" (3/4) ... [2022-07-13 04:53:29,340 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 04:53:29,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 04:53:29,341 INFO L158 Benchmark]: Toolchain (without parser) took 20434.81ms. Allocated memory was 86.0MB in the beginning and 132.1MB in the end (delta: 46.1MB). Free memory was 46.9MB in the beginning and 82.1MB in the end (delta: -35.2MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2022-07-13 04:53:29,341 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 86.0MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:53:29,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.43ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 46.7MB in the beginning and 76.1MB in the end (delta: -29.4MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-07-13 04:53:29,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.55ms. Allocated memory is still 109.1MB. Free memory was 76.1MB in the beginning and 73.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:53:29,342 INFO L158 Benchmark]: Boogie Preprocessor took 44.72ms. Allocated memory is still 109.1MB. Free memory was 73.9MB in the beginning and 72.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:53:29,342 INFO L158 Benchmark]: RCFGBuilder took 462.93ms. Allocated memory is still 109.1MB. Free memory was 72.5MB in the beginning and 82.2MB in the end (delta: -9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 04:53:29,343 INFO L158 Benchmark]: BuchiAutomizer took 19470.27ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 82.2MB in the beginning and 82.1MB in the end (delta: 75.7kB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2022-07-13 04:53:29,343 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 132.1MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:53:29,344 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.19ms. Allocated memory is still 86.0MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.43ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 46.7MB in the beginning and 76.1MB in the end (delta: -29.4MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.55ms. Allocated memory is still 109.1MB. Free memory was 76.1MB in the beginning and 73.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.72ms. Allocated memory is still 109.1MB. Free memory was 73.9MB in the beginning and 72.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 462.93ms. Allocated memory is still 109.1MB. Free memory was 72.5MB in the beginning and 82.2MB in the end (delta: -9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 19470.27ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 82.2MB in the beginning and 82.1MB in the end (delta: 75.7kB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 132.1MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (5 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[nondetString1] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.4s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 17.0s. Construction of modules took 0.3s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 51 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 492 mSDsluCounter, 758 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 543 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 566 IncrementalHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 215 mSDtfsCounter, 566 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU2 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital269 mio100 ax108 hnf100 lsp88 ukn76 mio100 lsp48 div104 bol100 ite100 ukn100 eq177 hnf91 smp91 dnf418 smp73 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 594ms VariablesStem: 13 VariablesLoop: 10 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-13 04:53:29,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:29,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:29,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE