./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4e9a16750b1d24e07696c6ab53b9e97b0ee6fcf6dce752052f3cbc796bfbdcce --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:36:16,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:36:16,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:36:16,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:36:16,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:36:16,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:36:16,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:36:16,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:36:16,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:36:16,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:36:16,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:36:16,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:36:16,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:36:16,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:36:16,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:36:16,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:36:16,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:36:16,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:36:16,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:36:16,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:36:16,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:36:16,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:36:16,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:36:16,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:36:16,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:36:16,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:36:16,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:36:16,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:36:16,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:36:16,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:36:16,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:36:16,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:36:16,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:36:16,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:36:16,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:36:16,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:36:16,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:36:16,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:36:16,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:36:16,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:36:16,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:36:16,703 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:36:16,728 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:36:16,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:36:16,729 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:36:16,729 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:36:16,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:36:16,730 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:36:16,730 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:36:16,730 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:36:16,730 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:36:16,730 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:36:16,731 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:36:16,731 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:36:16,731 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:36:16,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:36:16,732 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:36:16,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:36:16,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:36:16,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:36:16,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:36:16,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:36:16,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:36:16,732 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:36:16,733 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:36:16,733 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:36:16,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:36:16,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:36:16,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:36:16,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:36:16,734 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:36:16,734 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4e9a16750b1d24e07696c6ab53b9e97b0ee6fcf6dce752052f3cbc796bfbdcce [2022-02-21 03:36:16,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:36:16,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:36:16,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:36:16,980 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:36:16,980 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:36:16,981 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2.i [2022-02-21 03:36:17,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50aaa16da/9231544bcab64cd3b76d511e2d899705/FLAGf76be9a2b [2022-02-21 03:36:17,351 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:36:17,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2.i [2022-02-21 03:36:17,359 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50aaa16da/9231544bcab64cd3b76d511e2d899705/FLAGf76be9a2b [2022-02-21 03:36:17,773 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50aaa16da/9231544bcab64cd3b76d511e2d899705 [2022-02-21 03:36:17,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:36:17,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:36:17,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:17,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:36:17,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:36:17,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:17" (1/1) ... [2022-02-21 03:36:17,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103c925d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:17, skipping insertion in model container [2022-02-21 03:36:17,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:17" (1/1) ... [2022-02-21 03:36:17,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:36:17,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:36:17,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:17,919 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:36:17,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:17,942 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:36:17,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:17 WrapperNode [2022-02-21 03:36:17,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:17,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:17,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:36:17,943 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:36:17,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:17" (1/1) ... [2022-02-21 03:36:17,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:17" (1/1) ... [2022-02-21 03:36:17,974 INFO L137 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 34 [2022-02-21 03:36:17,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:17,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:36:17,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:36:17,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:36:17,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:17" (1/1) ... [2022-02-21 03:36:17,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:17" (1/1) ... [2022-02-21 03:36:17,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:17" (1/1) ... [2022-02-21 03:36:17,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:17" (1/1) ... [2022-02-21 03:36:17,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:17" (1/1) ... [2022-02-21 03:36:17,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:17" (1/1) ... [2022-02-21 03:36:17,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:17" (1/1) ... [2022-02-21 03:36:17,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:36:17,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:36:17,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:36:17,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:36:17,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:17" (1/1) ... [2022-02-21 03:36:17,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:18,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:18,045 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-02-21 03:36:18,104 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-02-21 03:36:18,123 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2022-02-21 03:36:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2022-02-21 03:36:18,124 INFO L130 BoogieDeclarations]: Found specification of procedure rec_cstrlen [2022-02-21 03:36:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_cstrlen [2022-02-21 03:36:18,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:36:18,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:36:18,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:36:18,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:36:18,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:36:18,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:36:18,194 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:36:18,195 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:36:18,415 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:36:18,420 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:36:18,420 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:36:18,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:18 BoogieIcfgContainer [2022-02-21 03:36:18,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:36:18,422 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:36:18,423 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:36:18,425 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:36:18,425 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:18,426 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:36:17" (1/3) ... [2022-02-21 03:36:18,427 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@640b3104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:18, skipping insertion in model container [2022-02-21 03:36:18,427 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:18,427 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:17" (2/3) ... [2022-02-21 03:36:18,427 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@640b3104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:18, skipping insertion in model container [2022-02-21 03:36:18,427 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:18,427 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:18" (3/3) ... [2022-02-21 03:36:18,428 INFO L388 chiAutomizerObserver]: Analyzing ICFG rec_strcopy_malloc2.i [2022-02-21 03:36:18,461 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:36:18,461 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:36:18,462 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:36:18,462 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:36:18,462 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:36:18,462 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:36:18,462 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:36:18,462 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:36:18,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:36:18,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:36:18,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:18,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:18,512 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:36:18,512 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:18,512 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:36:18,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:36:18,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:36:18,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:18,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:18,565 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:36:18,565 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:18,578 INFO L791 eck$LassoCheckResult]: Stem: 5#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~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_~length~1#1, main_~original~0#1.base, main_~original~0#1.offset, main_~res~0#1.base, main_~res~0#1.offset;main_~length~1#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 6#L43true assume main_~length~1#1 < 1;main_~length~1#1 := 1; 7#L43-2true assume { :begin_inline_build_nondet_String } true;build_nondet_String_#in~length#1 := main_~length~1#1;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length#1 := build_nondet_String_#in~length#1;call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 25#L12true main_#t~ret9#1.base, main_#t~ret9#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~original~0#1.base, main_~original~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_rec_strcopy } true;rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset := main_~original~0#1.base, main_~original~0#1.offset;havoc rec_strcopy_#res#1.base, rec_strcopy_#res#1.offset;havoc rec_strcopy_#t~ret6#1, rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset, rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~length~0#1, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset;rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset := rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset; 18#L34true call rec_strcopy_#t~ret6#1 := rec_cstrlen(rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset);< 13#rec_cstrlenENTRYtrue [2022-02-21 03:36:18,578 INFO L793 eck$LassoCheckResult]: Loop: 13#rec_cstrlenENTRYtrue ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 3#L17true assume !(0 == #t~mem2);havoc #t~mem2; 8#L20true call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 13#rec_cstrlenENTRYtrue [2022-02-21 03:36:18,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:18,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1155759803, now seen corresponding path program 1 times [2022-02-21 03:36:18,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:18,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875685610] [2022-02-21 03:36:18,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:18,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:18,688 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:18,736 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:18,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:18,739 INFO L85 PathProgramCache]: Analyzing trace with hash 59719, now seen corresponding path program 1 times [2022-02-21 03:36:18,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:18,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98248837] [2022-02-21 03:36:18,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:18,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:18,754 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:18,768 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:18,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:18,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1512490931, now seen corresponding path program 1 times [2022-02-21 03:36:18,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:18,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173205271] [2022-02-21 03:36:18,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:18,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:18,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {32#true} is VALID [2022-02-21 03:36:18,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_~length~1#1, main_~original~0#1.base, main_~original~0#1.offset, main_~res~0#1.base, main_~res~0#1.offset;main_~length~1#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {32#true} is VALID [2022-02-21 03:36:18,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume main_~length~1#1 < 1;main_~length~1#1 := 1; {34#(<= |ULTIMATE.start_main_~length~1#1| 1)} is VALID [2022-02-21 03:36:18,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#(<= |ULTIMATE.start_main_~length~1#1| 1)} assume { :begin_inline_build_nondet_String } true;build_nondet_String_#in~length#1 := main_~length~1#1;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length#1 := build_nondet_String_#in~length#1;call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {35#(= (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_#res#1.base|) |ULTIMATE.start_build_nondet_String_#res#1.offset|) 0)} is VALID [2022-02-21 03:36:18,942 INFO L290 TraceCheckUtils]: 4: Hoare triple {35#(= (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_#res#1.base|) |ULTIMATE.start_build_nondet_String_#res#1.offset|) 0)} main_#t~ret9#1.base, main_#t~ret9#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~original~0#1.base, main_~original~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_rec_strcopy } true;rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset := main_~original~0#1.base, main_~original~0#1.offset;havoc rec_strcopy_#res#1.base, rec_strcopy_#res#1.offset;havoc rec_strcopy_#t~ret6#1, rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset, rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~length~0#1, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset;rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset := rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset; {36#(= (select (select |#memory_int| |ULTIMATE.start_rec_strcopy_~source#1.base|) |ULTIMATE.start_rec_strcopy_~source#1.offset|) 0)} is VALID [2022-02-21 03:36:18,943 INFO L272 TraceCheckUtils]: 5: Hoare triple {36#(= (select (select |#memory_int| |ULTIMATE.start_rec_strcopy_~source#1.base|) |ULTIMATE.start_rec_strcopy_~source#1.offset|) 0)} call rec_strcopy_#t~ret6#1 := rec_cstrlen(rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset); {37#(= (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|) 0)} is VALID [2022-02-21 03:36:18,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#(= (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|) 0)} ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); {38#(= |rec_cstrlen_#t~mem2| 0)} is VALID [2022-02-21 03:36:18,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#(= |rec_cstrlen_#t~mem2| 0)} assume !(0 == #t~mem2);havoc #t~mem2; {33#false} is VALID [2022-02-21 03:36:18,944 INFO L272 TraceCheckUtils]: 8: Hoare triple {33#false} call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset); {33#false} is VALID [2022-02-21 03:36:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:18,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:18,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173205271] [2022-02-21 03:36:18,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173205271] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:18,946 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:18,946 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:36:18,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324204390] [2022-02-21 03:36:18,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:19,201 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:19,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:36:19,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:36:19,225 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:19,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:19,465 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-02-21 03:36:19,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:36:19,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:19,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:19,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2022-02-21 03:36:19,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:36:19,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 26 states and 29 transitions. [2022-02-21 03:36:19,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2022-02-21 03:36:19,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2022-02-21 03:36:19,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2022-02-21 03:36:19,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:19,485 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-02-21 03:36:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2022-02-21 03:36:19,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-02-21 03:36:19,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:19,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 29 transitions. Second operand has 24 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:19,502 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 29 transitions. Second operand has 24 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:19,503 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 24 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:19,505 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-02-21 03:36:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-02-21 03:36:19,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:19,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:19,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states and 29 transitions. [2022-02-21 03:36:19,507 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states and 29 transitions. [2022-02-21 03:36:19,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:19,509 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-02-21 03:36:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-02-21 03:36:19,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:19,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:19,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:19,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-02-21 03:36:19,513 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-21 03:36:19,513 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-21 03:36:19,513 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:36:19,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2022-02-21 03:36:19,514 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:36:19,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:19,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:19,514 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:36:19,514 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:19,515 INFO L791 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 87#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_~length~1#1, main_~original~0#1.base, main_~original~0#1.offset, main_~res~0#1.base, main_~res~0#1.offset;main_~length~1#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 88#L43 assume !(main_~length~1#1 < 1); 89#L43-2 assume { :begin_inline_build_nondet_String } true;build_nondet_String_#in~length#1 := main_~length~1#1;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length#1 := build_nondet_String_#in~length#1;call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 91#L12 main_#t~ret9#1.base, main_#t~ret9#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~original~0#1.base, main_~original~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_rec_strcopy } true;rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset := main_~original~0#1.base, main_~original~0#1.offset;havoc rec_strcopy_#res#1.base, rec_strcopy_#res#1.offset;havoc rec_strcopy_#t~ret6#1, rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset, rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~length~0#1, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset;rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset := rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset; 93#L34 call rec_strcopy_#t~ret6#1 := rec_cstrlen(rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset);< 94#rec_cstrlenENTRY [2022-02-21 03:36:19,515 INFO L793 eck$LassoCheckResult]: Loop: 94#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 105#L17 assume !(0 == #t~mem2);havoc #t~mem2; 92#L20 call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 94#rec_cstrlenENTRY [2022-02-21 03:36:19,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:19,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1155819385, now seen corresponding path program 1 times [2022-02-21 03:36:19,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:19,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036890668] [2022-02-21 03:36:19,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:19,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:19,527 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:19,534 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:19,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:19,535 INFO L85 PathProgramCache]: Analyzing trace with hash 59719, now seen corresponding path program 2 times [2022-02-21 03:36:19,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:19,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335332118] [2022-02-21 03:36:19,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:19,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:19,540 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:19,544 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:19,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash 262516431, now seen corresponding path program 1 times [2022-02-21 03:36:19,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:19,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623012803] [2022-02-21 03:36:19,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:19,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:19,559 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:19,570 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:20,284 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:20,284 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:20,285 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:20,285 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:20,285 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:20,285 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,285 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:20,285 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:20,285 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc2.i_Iteration2_Lasso [2022-02-21 03:36:20,286 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:20,286 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:20,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,362 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:36:20,363 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:36:20,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,770 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:20,772 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:20,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,784 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-02-21 03:36:20,790 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-02-21 03:36:20,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:20,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,798 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-02-21 03:36:20,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:20,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:20,813 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,846 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-02-21 03:36:20,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,847 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-02-21 03:36:20,848 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-02-21 03:36:20,850 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-02-21 03:36:20,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:20,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:20,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:20,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,889 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-02-21 03:36:20,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,893 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-02-21 03:36:20,894 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-02-21 03:36:20,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-02-21 03:36:20,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:20,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:20,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:20,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,934 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-02-21 03:36:20,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,936 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-02-21 03:36:20,937 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-02-21 03:36:20,938 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-02-21 03:36:20,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:20,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:20,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:20,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,986 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-02-21 03:36:20,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,988 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-02-21 03:36:20,989 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-02-21 03:36:20,990 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-02-21 03:36:20,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:20,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:20,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:21,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 03:36:21,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,030 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-02-21 03:36:21,031 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-02-21 03:36:21,032 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-02-21 03:36:21,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:21,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:21,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:21,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,069 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-02-21 03:36:21,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,071 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-02-21 03:36:21,072 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-02-21 03:36:21,073 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-02-21 03:36:21,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:21,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,079 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:36:21,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,080 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:36:21,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:21,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,115 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-02-21 03:36:21,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,128 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-02-21 03:36:21,143 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-02-21 03:36:21,144 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-02-21 03:36:21,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:21,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:21,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,197 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-02-21 03:36:21,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,198 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-02-21 03:36:21,199 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-02-21 03:36:21,201 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-02-21 03:36:21,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:21,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:21,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:21,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 03:36:21,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,241 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-02-21 03:36:21,246 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-02-21 03:36:21,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:21,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:21,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:21,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:21,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:21,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:21,262 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-02-21 03:36:21,269 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:21,279 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-02-21 03:36:21,279 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-02-21 03:36:21,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:21,286 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-02-21 03:36:21,312 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-02-21 03:36:21,343 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:21,372 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:21,372 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:21,372 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_cstrlen_#in~s.offset, v_rep(select #length rec_cstrlen_#in~s.base)_1) = -1*rec_cstrlen_#in~s.offset + 1*v_rep(select #length rec_cstrlen_#in~s.base)_1 Supporting invariants [] [2022-02-21 03:36:21,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:21,419 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:36:21,424 INFO L390 LassoCheck]: Loop: "~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1);" "assume !(0 == #t~mem2);havoc #t~mem2;" "call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);"< [2022-02-21 03:36:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:36:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:21,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {168#unseeded} is VALID [2022-02-21 03:36:21,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_~length~1#1, main_~original~0#1.base, main_~original~0#1.offset, main_~res~0#1.base, main_~res~0#1.offset;main_~length~1#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {168#unseeded} is VALID [2022-02-21 03:36:21,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#unseeded} assume !(main_~length~1#1 < 1); {168#unseeded} is VALID [2022-02-21 03:36:21,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {168#unseeded} assume { :begin_inline_build_nondet_String } true;build_nondet_String_#in~length#1 := main_~length~1#1;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length#1 := build_nondet_String_#in~length#1;call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {168#unseeded} is VALID [2022-02-21 03:36:21,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {168#unseeded} main_#t~ret9#1.base, main_#t~ret9#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~original~0#1.base, main_~original~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_rec_strcopy } true;rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset := main_~original~0#1.base, main_~original~0#1.offset;havoc rec_strcopy_#res#1.base, rec_strcopy_#res#1.offset;havoc rec_strcopy_#t~ret6#1, rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset, rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~length~0#1, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset;rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset := rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset; {168#unseeded} is VALID [2022-02-21 03:36:21,483 INFO L272 TraceCheckUtils]: 5: Hoare triple {168#unseeded} call rec_strcopy_#t~ret6#1 := rec_cstrlen(rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset); {168#unseeded} is VALID [2022-02-21 03:36:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:36:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:21,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#(>= oldRank0 (+ (select |#length| |rec_cstrlen_#in~s.base|) (* (- 1) |rec_cstrlen_#in~s.offset|)))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); {206#(and (<= (select |#length| rec_cstrlen_~s.base) (+ oldRank0 rec_cstrlen_~s.offset)) (<= (+ 1 rec_cstrlen_~s.offset) (select |#length| rec_cstrlen_~s.base)))} is VALID [2022-02-21 03:36:21,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#(and (<= (select |#length| rec_cstrlen_~s.base) (+ oldRank0 rec_cstrlen_~s.offset)) (<= (+ 1 rec_cstrlen_~s.offset) (select |#length| rec_cstrlen_~s.base)))} assume !(0 == #t~mem2);havoc #t~mem2; {206#(and (<= (select |#length| rec_cstrlen_~s.base) (+ oldRank0 rec_cstrlen_~s.offset)) (<= (+ 1 rec_cstrlen_~s.offset) (select |#length| rec_cstrlen_~s.base)))} is VALID [2022-02-21 03:36:21,540 INFO L272 TraceCheckUtils]: 2: Hoare triple {206#(and (<= (select |#length| rec_cstrlen_~s.base) (+ oldRank0 rec_cstrlen_~s.offset)) (<= (+ 1 rec_cstrlen_~s.offset) (select |#length| rec_cstrlen_~s.base)))} call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset); {186#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |rec_cstrlen_#in~s.base|) (* (- 1) |rec_cstrlen_#in~s.offset|)))))} is VALID [2022-02-21 03:36:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:21,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:21,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:21,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:21,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,555 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-02-21 03:36:21,555 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:21,643 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 48 transitions. Complement of second has 8 states. [2022-02-21 03:36:21,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:21,644 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:21,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. cyclomatic complexity: 5 [2022-02-21 03:36:21,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:21,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:21,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:21,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:21,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:21,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:21,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 48 transitions. [2022-02-21 03:36:21,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:21,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:21,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:21,655 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 27 transitions. cyclomatic complexity: 5 [2022-02-21 03:36:21,658 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:36:21,658 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:21,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:21,659 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:21,659 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 48 transitions. cyclomatic complexity: 8 [2022-02-21 03:36:21,660 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:21,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:21,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:21,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:21,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:21,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:21,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:21,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:21,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:21,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:21,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:36:21,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:36:21,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:36:21,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:36:21,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:36:21,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:36:21,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:21,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:21,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:21,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:21,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:21,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:21,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:36:21,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:36:21,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:36:21,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:36:21,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:36:21,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:36:21,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:21,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:21,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:21,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:21,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:21,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:21,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:21,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:21,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:21,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:21,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:21,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:21,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:21,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:21,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:21,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:36:21,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:36:21,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:36:21,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:36:21,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:36:21,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:36:21,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,678 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 03:36:21,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:21,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:21,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:21,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. cyclomatic complexity: 8 [2022-02-21 03:36:21,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:21,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 33 states and 39 transitions. [2022-02-21 03:36:21,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-02-21 03:36:21,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-02-21 03:36:21,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2022-02-21 03:36:21,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:21,689 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-02-21 03:36:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2022-02-21 03:36:21,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-02-21 03:36:21,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:21,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 39 transitions. Second operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:36:21,695 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 39 transitions. Second operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:36:21,696 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:36:21,696 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:21,704 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-02-21 03:36:21,704 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-02-21 03:36:21,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:21,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:21,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Second operand 33 states and 39 transitions. [2022-02-21 03:36:21,706 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Second operand 33 states and 39 transitions. [2022-02-21 03:36:21,706 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:21,711 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-02-21 03:36:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-02-21 03:36:21,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:21,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:21,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:21,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:21,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:36:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-02-21 03:36:21,715 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-02-21 03:36:21,715 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-02-21 03:36:21,715 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:36:21,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2022-02-21 03:36:21,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:21,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:21,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:21,717 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:21,717 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:21,718 INFO L791 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_~length~1#1, main_~original~0#1.base, main_~original~0#1.offset, main_~res~0#1.base, main_~res~0#1.offset;main_~length~1#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 273#L43 assume !(main_~length~1#1 < 1); 274#L43-2 assume { :begin_inline_build_nondet_String } true;build_nondet_String_#in~length#1 := main_~length~1#1;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length#1 := build_nondet_String_#in~length#1;call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 293#L12 main_#t~ret9#1.base, main_#t~ret9#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~original~0#1.base, main_~original~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_rec_strcopy } true;rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset := main_~original~0#1.base, main_~original~0#1.offset;havoc rec_strcopy_#res#1.base, rec_strcopy_#res#1.offset;havoc rec_strcopy_#t~ret6#1, rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset, rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~length~0#1, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset;rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset := rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset; 267#L34 call rec_strcopy_#t~ret6#1 := rec_cstrlen(rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset);< 284#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 266#L17 assume 0 == #t~mem2;havoc #t~mem2;#res := 0; 268#rec_cstrlenFINAL assume true; 294#rec_cstrlenEXIT >#41#return; 290#L34-1 rec_strcopy_~length~0#1 := rec_strcopy_#t~ret6#1;havoc rec_strcopy_#t~ret6#1;call rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1 + rec_strcopy_~length~0#1);rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset := rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset;havoc rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset; 278#L36 call rec_strcopy_helper(rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset);< 279#rec_strcopy_helperENTRY [2022-02-21 03:36:21,718 INFO L793 eck$LassoCheckResult]: Loop: 279#rec_strcopy_helperENTRY ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1); 283#L28 assume 0 != #t~mem5;havoc #t~mem5; 282#L29 call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 279#rec_strcopy_helperENTRY [2022-02-21 03:36:21,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:21,719 INFO L85 PathProgramCache]: Analyzing trace with hash -509542028, now seen corresponding path program 1 times [2022-02-21 03:36:21,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:21,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727537951] [2022-02-21 03:36:21,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:21,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:21,753 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:21,772 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:21,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:21,773 INFO L85 PathProgramCache]: Analyzing trace with hash 29922, now seen corresponding path program 1 times [2022-02-21 03:36:21,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:21,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279883558] [2022-02-21 03:36:21,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:21,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:21,790 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:21,799 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:21,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:21,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1352131953, now seen corresponding path program 1 times [2022-02-21 03:36:21,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:21,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394921261] [2022-02-21 03:36:21,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:21,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:36:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {499#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); {511#(= |rec_cstrlen_#t~mem2| (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|))} is VALID [2022-02-21 03:36:21,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {511#(= |rec_cstrlen_#t~mem2| (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|))} assume 0 == #t~mem2;havoc #t~mem2;#res := 0; {512#(= (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|) 0)} is VALID [2022-02-21 03:36:21,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#(= (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|) 0)} assume true; {512#(= (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|) 0)} is VALID [2022-02-21 03:36:21,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#(= (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|) 0)} {502#(= (select |#valid| |ULTIMATE.start_rec_strcopy_~source#1.base|) 1)} #41#return; {507#(and (= (select |#valid| |ULTIMATE.start_rec_strcopy_~source#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_rec_strcopy_~source#1.base|) |ULTIMATE.start_rec_strcopy_~source#1.offset|) 0))} is VALID [2022-02-21 03:36:21,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {499#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {499#true} is VALID [2022-02-21 03:36:21,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {499#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_~length~1#1, main_~original~0#1.base, main_~original~0#1.offset, main_~res~0#1.base, main_~res~0#1.offset;main_~length~1#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {499#true} is VALID [2022-02-21 03:36:21,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {499#true} assume !(main_~length~1#1 < 1); {499#true} is VALID [2022-02-21 03:36:21,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {499#true} assume { :begin_inline_build_nondet_String } true;build_nondet_String_#in~length#1 := main_~length~1#1;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length#1 := build_nondet_String_#in~length#1;call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {501#(= (select |#valid| |ULTIMATE.start_build_nondet_String_#res#1.base|) 1)} is VALID [2022-02-21 03:36:21,967 INFO L290 TraceCheckUtils]: 4: Hoare triple {501#(= (select |#valid| |ULTIMATE.start_build_nondet_String_#res#1.base|) 1)} main_#t~ret9#1.base, main_#t~ret9#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~original~0#1.base, main_~original~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_rec_strcopy } true;rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset := main_~original~0#1.base, main_~original~0#1.offset;havoc rec_strcopy_#res#1.base, rec_strcopy_#res#1.offset;havoc rec_strcopy_#t~ret6#1, rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset, rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~length~0#1, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset;rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset := rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset; {502#(= (select |#valid| |ULTIMATE.start_rec_strcopy_~source#1.base|) 1)} is VALID [2022-02-21 03:36:21,968 INFO L272 TraceCheckUtils]: 5: Hoare triple {502#(= (select |#valid| |ULTIMATE.start_rec_strcopy_~source#1.base|) 1)} call rec_strcopy_#t~ret6#1 := rec_cstrlen(rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset); {499#true} is VALID [2022-02-21 03:36:21,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {499#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); {511#(= |rec_cstrlen_#t~mem2| (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|))} is VALID [2022-02-21 03:36:21,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {511#(= |rec_cstrlen_#t~mem2| (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|))} assume 0 == #t~mem2;havoc #t~mem2;#res := 0; {512#(= (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|) 0)} is VALID [2022-02-21 03:36:21,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#(= (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|) 0)} assume true; {512#(= (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|) 0)} is VALID [2022-02-21 03:36:21,981 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {512#(= (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|) 0)} {502#(= (select |#valid| |ULTIMATE.start_rec_strcopy_~source#1.base|) 1)} #41#return; {507#(and (= (select |#valid| |ULTIMATE.start_rec_strcopy_~source#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_rec_strcopy_~source#1.base|) |ULTIMATE.start_rec_strcopy_~source#1.offset|) 0))} is VALID [2022-02-21 03:36:21,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {507#(and (= (select |#valid| |ULTIMATE.start_rec_strcopy_~source#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_rec_strcopy_~source#1.base|) |ULTIMATE.start_rec_strcopy_~source#1.offset|) 0))} rec_strcopy_~length~0#1 := rec_strcopy_#t~ret6#1;havoc rec_strcopy_#t~ret6#1;call rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1 + rec_strcopy_~length~0#1);rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset := rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset;havoc rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset; {508#(and (not (= |ULTIMATE.start_rec_strcopy_~copyAlloc~0#1.base| |ULTIMATE.start_rec_strcopy_~source#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_rec_strcopy_~source#1.base|) |ULTIMATE.start_rec_strcopy_~source#1.offset|) 0))} is VALID [2022-02-21 03:36:21,983 INFO L272 TraceCheckUtils]: 11: Hoare triple {508#(and (not (= |ULTIMATE.start_rec_strcopy_~copyAlloc~0#1.base| |ULTIMATE.start_rec_strcopy_~source#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_rec_strcopy_~source#1.base|) |ULTIMATE.start_rec_strcopy_~source#1.offset|) 0))} call rec_strcopy_helper(rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset); {509#(and (not (= |rec_strcopy_helper_#in~source.base| |rec_strcopy_helper_#in~dest.base|)) (= (select (select |#memory_int| |rec_strcopy_helper_#in~source.base|) |rec_strcopy_helper_#in~source.offset|) 0))} is VALID [2022-02-21 03:36:21,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {509#(and (not (= |rec_strcopy_helper_#in~source.base| |rec_strcopy_helper_#in~dest.base|)) (= (select (select |#memory_int| |rec_strcopy_helper_#in~source.base|) |rec_strcopy_helper_#in~source.offset|) 0))} ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1); {510#(and (not (= rec_strcopy_helper_~dest.base rec_strcopy_helper_~source.base)) (= |rec_strcopy_helper_#t~mem5| 0))} is VALID [2022-02-21 03:36:21,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {510#(and (not (= rec_strcopy_helper_~dest.base rec_strcopy_helper_~source.base)) (= |rec_strcopy_helper_#t~mem5| 0))} assume 0 != #t~mem5;havoc #t~mem5; {500#false} is VALID [2022-02-21 03:36:21,984 INFO L272 TraceCheckUtils]: 14: Hoare triple {500#false} call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset); {500#false} is VALID [2022-02-21 03:36:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:21,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:21,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394921261] [2022-02-21 03:36:21,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394921261] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:21,985 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:21,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-21 03:36:21,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035450138] [2022-02-21 03:36:21,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:22,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:22,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:22,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:36:22,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:36:22,461 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 6 Second operand has 10 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:36:22,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:22,703 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-02-21 03:36:22,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:36:22,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:36:22,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:22,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2022-02-21 03:36:22,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:22,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 23 transitions. [2022-02-21 03:36:22,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-02-21 03:36:22,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-02-21 03:36:22,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2022-02-21 03:36:22,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:22,721 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-21 03:36:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2022-02-21 03:36:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-21 03:36:22,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:22,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 23 transitions. Second operand has 21 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:36:22,725 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 23 transitions. Second operand has 21 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:36:22,725 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 21 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:36:22,725 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:22,728 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-21 03:36:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-21 03:36:22,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:22,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:22,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 21 states and 23 transitions. [2022-02-21 03:36:22,729 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 21 states and 23 transitions. [2022-02-21 03:36:22,730 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:22,734 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-21 03:36:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-21 03:36:22,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:22,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:22,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:22,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:36:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-21 03:36:22,739 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-21 03:36:22,739 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-21 03:36:22,739 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:36:22,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2022-02-21 03:36:22,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:22,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:22,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:22,741 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:22,741 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:22,741 INFO L791 eck$LassoCheckResult]: Stem: 561#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 562#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_~length~1#1, main_~original~0#1.base, main_~original~0#1.offset, main_~res~0#1.base, main_~res~0#1.offset;main_~length~1#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 563#L43 assume !(main_~length~1#1 < 1); 564#L43-2 assume { :begin_inline_build_nondet_String } true;build_nondet_String_#in~length#1 := main_~length~1#1;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length#1 := build_nondet_String_#in~length#1;call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 565#L12 main_#t~ret9#1.base, main_#t~ret9#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~original~0#1.base, main_~original~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_rec_strcopy } true;rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset := main_~original~0#1.base, main_~original~0#1.offset;havoc rec_strcopy_#res#1.base, rec_strcopy_#res#1.offset;havoc rec_strcopy_#t~ret6#1, rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset, rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~length~0#1, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset;rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset := rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset; 560#L34 call rec_strcopy_#t~ret6#1 := rec_cstrlen(rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset);< 573#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 559#L17 assume !(0 == #t~mem2);havoc #t~mem2; 557#L20 call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 566#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 556#L17 assume 0 == #t~mem2;havoc #t~mem2;#res := 0; 558#rec_cstrlenFINAL assume true; 574#rec_cstrlenEXIT >#45#return; 569#L20-1 #res := 1 + #t~ret3;havoc #t~ret3; 570#rec_cstrlenFINAL assume true; 576#rec_cstrlenEXIT >#41#return; 575#L34-1 rec_strcopy_~length~0#1 := rec_strcopy_#t~ret6#1;havoc rec_strcopy_#t~ret6#1;call rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1 + rec_strcopy_~length~0#1);rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset := rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset;havoc rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset; 567#L36 call rec_strcopy_helper(rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset);< 568#rec_strcopy_helperENTRY [2022-02-21 03:36:22,741 INFO L793 eck$LassoCheckResult]: Loop: 568#rec_strcopy_helperENTRY ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1); 572#L28 assume 0 != #t~mem5;havoc #t~mem5; 571#L29 call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 568#rec_strcopy_helperENTRY [2022-02-21 03:36:22,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:22,742 INFO L85 PathProgramCache]: Analyzing trace with hash -462834206, now seen corresponding path program 1 times [2022-02-21 03:36:22,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:22,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335376339] [2022-02-21 03:36:22,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:22,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:22,771 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:22,783 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:22,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:22,785 INFO L85 PathProgramCache]: Analyzing trace with hash 29922, now seen corresponding path program 2 times [2022-02-21 03:36:22,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:22,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070447536] [2022-02-21 03:36:22,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:22,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:22,795 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:22,800 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:22,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:22,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1448810655, now seen corresponding path program 1 times [2022-02-21 03:36:22,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:22,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616331283] [2022-02-21 03:36:22,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:22,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:22,829 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:22,846 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:24,506 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:24,506 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:24,506 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:24,506 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:24,506 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:24,506 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:24,507 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:24,507 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:24,507 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc2.i_Iteration4_Lasso [2022-02-21 03:36:24,507 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:24,507 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:24,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,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-02-21 03:36:24,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,714 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:36:24,715 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:36:24,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:25,254 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:25,254 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:25,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:25,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,259 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-02-21 03:36:25,260 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-02-21 03:36:25,264 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-02-21 03:36:25,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:25,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:25,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:25,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:25,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:25,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:25,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:25,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:25,297 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-02-21 03:36:25,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:25,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,298 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-02-21 03:36:25,299 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-02-21 03:36:25,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:25,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:25,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:25,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:25,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:25,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:25,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:25,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:25,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:25,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 03:36:25,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:25,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,324 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-02-21 03:36:25,325 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-02-21 03:36:25,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:25,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:25,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:25,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:25,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:25,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:25,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:25,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:25,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:25,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 03:36:25,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:25,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,366 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-02-21 03:36:25,367 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-02-21 03:36:25,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:25,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:25,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:25,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:25,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:25,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:25,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:25,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:25,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:25,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 03:36:25,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:25,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,405 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-02-21 03:36:25,406 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-02-21 03:36:25,407 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-02-21 03:36:25,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:25,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:25,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:25,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:25,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:25,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:25,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:25,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:25,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:36:25,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:25,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,453 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-02-21 03:36:25,454 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-02-21 03:36:25,456 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-02-21 03:36:25,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:25,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:25,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:25,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:25,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:25,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:25,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:25,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:25,503 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-02-21 03:36:25,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:25,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,505 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-02-21 03:36:25,506 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-02-21 03:36:25,507 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-02-21 03:36:25,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:25,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:25,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:25,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:25,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:25,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:25,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:25,532 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-02-21 03:36:25,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:25,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,533 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-02-21 03:36:25,535 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-02-21 03:36:25,535 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-02-21 03:36:25,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:25,541 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 03:36:25,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:25,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:25,547 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 03:36:25,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:25,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:25,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 03:36:25,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:25,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,572 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-02-21 03:36:25,574 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-02-21 03:36:25,575 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-02-21 03:36:25,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:25,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:25,583 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:36:25,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:25,600 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 03:36:25,601 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:36:25,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:25,652 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-02-21 03:36:25,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:25,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,654 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-02-21 03:36:25,667 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-02-21 03:36:25,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:25,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:25,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:25,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:25,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:25,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:25,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:25,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:25,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:25,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:25,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,708 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-02-21 03:36:25,709 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-02-21 03:36:25,710 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-02-21 03:36:25,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:25,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:25,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:25,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:25,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:25,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:25,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:25,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:25,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:25,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:25,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,735 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-02-21 03:36:25,735 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-02-21 03:36:25,737 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-02-21 03:36:25,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:25,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:25,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:25,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:25,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:25,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:25,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:25,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:25,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:25,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,770 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-02-21 03:36:25,770 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-02-21 03:36:25,772 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-02-21 03:36:25,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:25,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:25,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:25,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:25,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:25,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:25,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:25,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:36:25,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:25,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,806 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-02-21 03:36:25,807 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-02-21 03:36:25,848 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-02-21 03:36:25,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:25,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:25,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:25,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:25,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:25,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:25,866 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:25,879 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-02-21 03:36:25,880 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-02-21 03:36:25,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:25,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,881 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-02-21 03:36:25,882 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-02-21 03:36:25,883 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:25,891 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:25,891 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:25,891 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length rec_strcopy_helper_#in~dest.base)_1, rec_strcopy_helper_#in~dest.offset) = 1*v_rep(select #length rec_strcopy_helper_#in~dest.base)_1 - 1*rec_strcopy_helper_#in~dest.offset Supporting invariants [] [2022-02-21 03:36:25,910 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-02-21 03:36:25,933 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-02-21 03:36:25,936 INFO L390 LassoCheck]: Loop: "~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1);" "assume 0 != #t~mem5;havoc #t~mem5;" "call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);"< [2022-02-21 03:36:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:25,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:26,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:36:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:26,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:26,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:26,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {724#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {724#unseeded} is VALID [2022-02-21 03:36:26,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {724#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_~length~1#1, main_~original~0#1.base, main_~original~0#1.offset, main_~res~0#1.base, main_~res~0#1.offset;main_~length~1#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {724#unseeded} is VALID [2022-02-21 03:36:26,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {724#unseeded} assume !(main_~length~1#1 < 1); {724#unseeded} is VALID [2022-02-21 03:36:26,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {724#unseeded} assume { :begin_inline_build_nondet_String } true;build_nondet_String_#in~length#1 := main_~length~1#1;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length#1 := build_nondet_String_#in~length#1;call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {724#unseeded} is VALID [2022-02-21 03:36:26,236 INFO L290 TraceCheckUtils]: 4: Hoare triple {724#unseeded} main_#t~ret9#1.base, main_#t~ret9#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~original~0#1.base, main_~original~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_rec_strcopy } true;rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset := main_~original~0#1.base, main_~original~0#1.offset;havoc rec_strcopy_#res#1.base, rec_strcopy_#res#1.offset;havoc rec_strcopy_#t~ret6#1, rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset, rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~length~0#1, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset;rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset := rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset; {724#unseeded} is VALID [2022-02-21 03:36:26,236 INFO L272 TraceCheckUtils]: 5: Hoare triple {724#unseeded} call rec_strcopy_#t~ret6#1 := rec_cstrlen(rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset); {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:26,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:26,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == #t~mem2);havoc #t~mem2; {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:26,239 INFO L272 TraceCheckUtils]: 8: Hoare triple {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset); {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:26,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:26,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == #t~mem2;havoc #t~mem2;#res := 0; {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:26,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:26,242 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #45#return; {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:26,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret3;havoc #t~ret3; {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:26,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:26,246 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {782#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {724#unseeded} #41#return; {724#unseeded} is VALID [2022-02-21 03:36:26,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {724#unseeded} rec_strcopy_~length~0#1 := rec_strcopy_#t~ret6#1;havoc rec_strcopy_#t~ret6#1;call rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset := #Ultimate.allocOnHeap(1 + rec_strcopy_~length~0#1);rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset := rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset;havoc rec_strcopy_#t~malloc7#1.base, rec_strcopy_#t~malloc7#1.offset; {724#unseeded} is VALID [2022-02-21 03:36:26,248 INFO L272 TraceCheckUtils]: 17: Hoare triple {724#unseeded} call rec_strcopy_helper(rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset); {724#unseeded} is VALID [2022-02-21 03:36:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:26,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:36:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:26,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:26,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {727#(>= oldRank0 (+ (select |#length| |rec_strcopy_helper_#in~dest.base|) (* (- 1) |rec_strcopy_helper_#in~dest.offset|)))} ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1); {819#(and (<= (select |#length| rec_strcopy_helper_~dest.base) (+ oldRank0 rec_strcopy_helper_~dest.offset)) (<= (+ rec_strcopy_helper_~dest.offset 1) (select |#length| rec_strcopy_helper_~dest.base)))} is VALID [2022-02-21 03:36:26,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {819#(and (<= (select |#length| rec_strcopy_helper_~dest.base) (+ oldRank0 rec_strcopy_helper_~dest.offset)) (<= (+ rec_strcopy_helper_~dest.offset 1) (select |#length| rec_strcopy_helper_~dest.base)))} assume 0 != #t~mem5;havoc #t~mem5; {819#(and (<= (select |#length| rec_strcopy_helper_~dest.base) (+ oldRank0 rec_strcopy_helper_~dest.offset)) (<= (+ rec_strcopy_helper_~dest.offset 1) (select |#length| rec_strcopy_helper_~dest.base)))} is VALID [2022-02-21 03:36:26,318 INFO L272 TraceCheckUtils]: 2: Hoare triple {819#(and (<= (select |#length| rec_strcopy_helper_~dest.base) (+ oldRank0 rec_strcopy_helper_~dest.offset)) (<= (+ rec_strcopy_helper_~dest.offset 1) (select |#length| rec_strcopy_helper_~dest.base)))} call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset); {762#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |rec_strcopy_helper_#in~dest.base|) (* (- 1) |rec_strcopy_helper_#in~dest.offset|)))))} is VALID [2022-02-21 03:36:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:26,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:26,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:26,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:36:26,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,339 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-02-21 03:36:26,340 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:26,414 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 33 states and 36 transitions. Complement of second has 9 states. [2022-02-21 03:36:26,414 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-02-21 03:36:26,415 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:26,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:26,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:26,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:26,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:26,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:26,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:26,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:26,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 36 transitions. [2022-02-21 03:36:26,417 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:26,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:26,417 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 23 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:26,418 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:26,418 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:26,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:26,419 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:26,419 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 36 transitions. cyclomatic complexity: 5 [2022-02-21 03:36:26,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 36 transitions. cyclomatic complexity: 5 [2022-02-21 03:36:26,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:26,419 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:36:26,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:36:26,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:36:26,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:36:26,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:26,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:26,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:26,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 33 letters. Loop has 33 letters. [2022-02-21 03:36:26,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 33 letters. Loop has 33 letters. [2022-02-21 03:36:26,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 33 letters. Loop has 33 letters. [2022-02-21 03:36:26,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:36:26,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:36:26,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:36:26,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:36:26,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:36:26,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:36:26,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:36:26,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:36:26,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:36:26,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:26,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:26,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:26,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:36:26,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:36:26,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:36:26,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:26,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:26,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:26,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,426 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:26,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-02-21 03:36:26,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:36:26,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:36:26,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:36:26,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:26,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. cyclomatic complexity: 5 [2022-02-21 03:36:26,430 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:26,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2022-02-21 03:36:26,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:36:26,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:36:26,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:36:26,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:26,430 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:26,431 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:26,431 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:26,431 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:36:26,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:36:26,431 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:26,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:26,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:36:26 BoogieIcfgContainer [2022-02-21 03:36:26,439 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:36:26,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:36:26,440 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:36:26,440 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:36:26,440 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:18" (3/4) ... [2022-02-21 03:36:26,442 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:36:26,442 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:36:26,445 INFO L158 Benchmark]: Toolchain (without parser) took 8667.16ms. Allocated memory was 90.2MB in the beginning and 192.9MB in the end (delta: 102.8MB). Free memory was 51.1MB in the beginning and 132.1MB in the end (delta: -81.0MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2022-02-21 03:36:26,445 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory is still 67.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:26,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.39ms. Allocated memory was 90.2MB in the beginning and 125.8MB in the end (delta: 35.7MB). Free memory was 50.8MB in the beginning and 102.0MB in the end (delta: -51.2MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2022-02-21 03:36:26,446 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.41ms. Allocated memory is still 125.8MB. Free memory was 102.0MB in the beginning and 103.8MB in the end (delta: -1.9MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2022-02-21 03:36:26,446 INFO L158 Benchmark]: Boogie Preprocessor took 14.93ms. Allocated memory is still 125.8MB. Free memory was 103.8MB in the beginning and 102.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:36:26,446 INFO L158 Benchmark]: RCFGBuilder took 431.51ms. Allocated memory is still 125.8MB. Free memory was 102.6MB in the beginning and 89.2MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:36:26,446 INFO L158 Benchmark]: BuchiAutomizer took 8016.96ms. Allocated memory was 125.8MB in the beginning and 192.9MB in the end (delta: 67.1MB). Free memory was 89.2MB in the beginning and 132.1MB in the end (delta: -42.9MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2022-02-21 03:36:26,446 INFO L158 Benchmark]: Witness Printer took 2.37ms. Allocated memory is still 192.9MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:26,447 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory is still 67.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 165.39ms. Allocated memory was 90.2MB in the beginning and 125.8MB in the end (delta: 35.7MB). Free memory was 50.8MB in the beginning and 102.0MB in the end (delta: -51.2MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.41ms. Allocated memory is still 125.8MB. Free memory was 102.0MB in the beginning and 103.8MB in the end (delta: -1.9MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.93ms. Allocated memory is still 125.8MB. Free memory was 103.8MB in the beginning and 102.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 431.51ms. Allocated memory is still 125.8MB. Free memory was 102.6MB in the beginning and 89.2MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 8016.96ms. Allocated memory was 125.8MB in the beginning and 192.9MB in the end (delta: 67.1MB). Free memory was 89.2MB in the beginning and 132.1MB in the end (delta: -42.9MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * Witness Printer took 2.37ms. Allocated memory is still 192.9MB. Free memory is still 132.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 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[dest] + -1 * dest and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 6.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 306 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 229 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 147 IncrementalHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 77 mSDtfsCounter, 147 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital144 mio100 ax100 hnf100 lsp95 ukn64 mio100 lsp44 div100 bol100 ite100 ukn100 eq174 hnf90 smp100 dnf103 smp96 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:36:26,484 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