./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/openbsd_cstpcpy-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f22afdea3888c472e42c0b4bee511704d4ceb9c1e2d9f4db0ce5ffbd6de758f0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:35:16,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:35:16,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:35:16,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:35:16,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:35:16,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:35:16,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:35:16,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:35:16,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:35:16,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:35:16,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:35:16,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:35:16,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:35:16,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:35:16,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:35:16,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:35:16,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:35:16,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:35:16,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:35:16,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:35:16,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:35:16,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:35:16,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:35:16,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:35:16,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:35:16,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:35:16,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:35:16,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:35:16,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:35:16,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:35:16,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:35:16,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:35:16,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:35:16,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:35:16,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:35:16,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:35:16,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:35:16,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:35:16,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:35:16,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:35:16,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:35:16,937 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:35:16,959 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:35:16,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:35:16,960 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:35:16,960 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:35:16,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:35:16,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:35:16,962 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:35:16,962 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:35:16,962 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:35:16,962 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:35:16,963 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:35:16,963 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:35:16,963 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:35:16,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:35:16,963 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:35:16,964 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:35:16,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:35:16,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:35:16,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:35:16,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:35:16,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:35:16,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:35:16,964 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:35:16,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:35:16,965 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:35:16,965 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:35:16,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:35:16,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:35:16,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:35:16,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:35:16,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:35:16,966 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:35:16,966 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f22afdea3888c472e42c0b4bee511704d4ceb9c1e2d9f4db0ce5ffbd6de758f0 [2022-02-21 04:35:17,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:35:17,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:35:17,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:35:17,190 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:35:17,191 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:35:17,192 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i [2022-02-21 04:35:17,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2a2bf86/b79438e54f2941c8ab954268203f8e0a/FLAG8759900e3 [2022-02-21 04:35:17,649 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:35:17,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i [2022-02-21 04:35:17,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2a2bf86/b79438e54f2941c8ab954268203f8e0a/FLAG8759900e3 [2022-02-21 04:35:17,666 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2a2bf86/b79438e54f2941c8ab954268203f8e0a [2022-02-21 04:35:17,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:35:17,669 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:35:17,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:17,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:35:17,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:35:17,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:17" (1/1) ... [2022-02-21 04:35:17,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be755e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:17, skipping insertion in model container [2022-02-21 04:35:17,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:17" (1/1) ... [2022-02-21 04:35:17,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:35:17,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:35:17,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:17,909 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:35:17,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:17,963 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:35:17,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:17 WrapperNode [2022-02-21 04:35:17,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:17,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:17,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:35:17,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:35:17,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:17" (1/1) ... [2022-02-21 04:35:17,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:17" (1/1) ... [2022-02-21 04:35:17,992 INFO L137 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2022-02-21 04:35:17,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:17,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:35:17,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:35:17,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:35:17,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:17" (1/1) ... [2022-02-21 04:35:17,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:17" (1/1) ... [2022-02-21 04:35:18,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:17" (1/1) ... [2022-02-21 04:35:18,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:17" (1/1) ... [2022-02-21 04:35:18,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:17" (1/1) ... [2022-02-21 04:35:18,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:17" (1/1) ... [2022-02-21 04:35:18,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:17" (1/1) ... [2022-02-21 04:35:18,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:35:18,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:35:18,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:35:18,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:35:18,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:17" (1/1) ... [2022-02-21 04:35:18,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:18,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:18,084 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 04:35:18,086 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 04:35:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:35:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:35:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:35:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:35:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:35:18,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:35:18,186 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:35:18,188 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:18,306 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:18,310 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:18,311 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 04:35:18,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:18 BoogieIcfgContainer [2022-02-21 04:35:18,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:18,313 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:18,313 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:18,316 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:18,316 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:18,316 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:35:17" (1/3) ... [2022-02-21 04:35:18,317 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76bc1220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:18, skipping insertion in model container [2022-02-21 04:35:18,317 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:18,317 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:17" (2/3) ... [2022-02-21 04:35:18,317 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76bc1220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:18, skipping insertion in model container [2022-02-21 04:35:18,318 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:18,318 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:18" (3/3) ... [2022-02-21 04:35:18,318 INFO L388 chiAutomizerObserver]: Analyzing ICFG openbsd_cstpcpy-alloca-1.i [2022-02-21 04:35:18,385 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:18,385 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:18,386 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:18,386 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:18,386 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:18,386 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:18,386 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:18,386 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:18,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:18,426 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:18,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:18,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:18,429 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:18,430 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:18,430 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:18,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:18,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:18,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:18,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:18,435 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:18,435 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:18,441 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~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 12#L521true assume !(main_~length1~0#1 < 1); 8#L521-2true assume !(main_~length2~0#1 < 1); 11#L524-1true assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 4#L531-3true [2022-02-21 04:35:18,441 INFO L793 eck$LassoCheckResult]: Loop: 4#L531-3true assume !!(main_~i~0#1 < main_~length2~0#1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 13#L531-2true main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4#L531-3true [2022-02-21 04:35:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2022-02-21 04:35:18,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:18,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601041793] [2022-02-21 04:35:18,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:18,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:18,542 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:18,567 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:18,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:18,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2022-02-21 04:35:18,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:18,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674281264] [2022-02-21 04:35:18,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:18,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:18,580 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:18,588 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:18,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:18,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1806939692, now seen corresponding path program 1 times [2022-02-21 04:35:18,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:18,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614106120] [2022-02-21 04:35:18,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:18,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:18,615 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:18,638 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:19,014 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:19,015 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:19,015 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:19,015 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:19,015 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:19,015 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:19,015 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:19,016 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:19,016 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpcpy-alloca-1.i_Iteration1_Lasso [2022-02-21 04:35:19,016 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:19,016 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:19,032 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 04:35:19,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:19,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:19,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:19,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:19,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:19,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:19,251 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 04:35:19,255 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 04:35:19,257 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 04:35:19,268 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 04:35:19,273 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 04:35:19,275 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 04:35:19,570 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:19,573 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:19,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:19,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:19,576 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 04:35:19,577 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 04:35:19,579 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 04:35:19,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:19,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:19,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:19,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:19,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:19,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:19,619 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:19,660 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-02-21 04:35:19,660 INFO L444 ModelExtractionUtils]: 8 out of 28 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-02-21 04:35:19,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:19,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:19,663 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 04:35:19,711 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 04:35:19,712 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:19,728 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 04:35:19,729 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:19,729 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~nondetString~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString~0#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~nondetString~0#1.offset >= 0] [2022-02-21 04:35:19,748 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 04:35:19,786 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2022-02-21 04:35:19,795 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length2~0#1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;" "main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2022-02-21 04:35:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:19,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:19,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:19,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:19,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {26#unseeded} is VALID [2022-02-21 04:35:19,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {26#unseeded} is VALID [2022-02-21 04:35:19,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#unseeded} assume !(main_~length1~0#1 < 1); {26#unseeded} is VALID [2022-02-21 04:35:19,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#unseeded} assume !(main_~length2~0#1 < 1); {26#unseeded} is VALID [2022-02-21 04:35:19,886 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#unseeded} assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; {75#(and unseeded (>= |ULTIMATE.start_main_~nondetString~0#1.offset| 0))} is VALID [2022-02-21 04:35:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:19,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 04:35:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:19,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:19,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {76#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) (>= |ULTIMATE.start_main_~nondetString~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length2~0#1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; {96#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) (>= |ULTIMATE.start_main_~nondetString~0#1.offset| 0))} is VALID [2022-02-21 04:35:19,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))) (>= |ULTIMATE.start_main_~nondetString~0#1.offset| 0))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {78#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString~0#1.base|))))) (>= |ULTIMATE.start_main_~nondetString~0#1.offset| 0))} is VALID [2022-02-21 04:35:19,937 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 04:35:19,966 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), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:19,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:19,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:19,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:19,981 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 04:35:19,982 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,062 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 50 transitions. Complement of second has 7 states. [2022-02-21 04:35:20,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:20,062 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:20,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:20,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:20,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:20,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:20,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:20,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:20,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2022-02-21 04:35:20,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:20,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:20,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:20,069 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 04:35:20,071 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:35:20,071 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,072 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:20,072 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:20,072 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 50 transitions. cyclomatic complexity: 15 [2022-02-21 04:35:20,073 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:20,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:20,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:20,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:20,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:20,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:20,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:20,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:20,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:20,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:20,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 39 letters. [2022-02-21 04:35:20,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 39 letters. [2022-02-21 04:35:20,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 39 letters. Loop has 39 letters. [2022-02-21 04:35:20,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:20,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:20,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:20,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:20,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:20,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:20,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:20,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:20,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:20,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:20,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:20,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:20,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:20,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:20,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:20,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:20,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:20,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:20,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:20,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:20,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:20,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:20,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:20,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:20,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,112 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 04:35:20,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:20,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:20,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:20,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:20,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:20,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:35:20,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:20,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:20,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:35:20,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:20,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:20,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:35:20,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,123 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-02-21 04:35:20,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:20,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:20,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:35:20,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:20,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. cyclomatic complexity: 15 [2022-02-21 04:35:20,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:20,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 12 states and 16 transitions. [2022-02-21 04:35:20,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 04:35:20,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 04:35:20,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2022-02-21 04:35:20,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:20,144 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 04:35:20,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2022-02-21 04:35:20,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 04:35:20,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:20,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,160 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,161 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:20,163 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 04:35:20,163 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 04:35:20,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:20,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:20,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 16 transitions. [2022-02-21 04:35:20,164 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 16 transitions. [2022-02-21 04:35:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:20,165 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 04:35:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 04:35:20,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:20,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:20,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:20,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-02-21 04:35:20,166 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 04:35:20,167 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 04:35:20,167 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:20,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 04:35:20,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:20,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:20,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:20,167 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:20,167 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:20,168 INFO L791 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 155#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 161#L521 assume !(main_~length1~0#1 < 1); 159#L521-2 assume !(main_~length2~0#1 < 1); 160#L524-1 assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 150#L531-3 assume !(main_~i~0#1 < main_~length2~0#1); 151#L531-4 call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstpcpy } true;cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset, cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstpcpy_#res#1.base, cstpcpy_#res#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset, cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset, cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, cstpcpy_~from#1.base, cstpcpy_~from#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset; 158#L515-4 [2022-02-21 04:35:20,168 INFO L793 eck$LassoCheckResult]: Loop: 158#L515-4 call cstpcpy_#t~mem4#1 := read~int(cstpcpy_~from#1.base, cstpcpy_~from#1.offset, 1);call write~int(cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, 1); 156#L515-1 assume !!(0 != cstpcpy_#t~mem4#1);havoc cstpcpy_#t~mem4#1; 157#L515-3 cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset;cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;havoc cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset; 158#L515-4 [2022-02-21 04:35:20,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:20,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1806939634, now seen corresponding path program 1 times [2022-02-21 04:35:20,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:20,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889796288] [2022-02-21 04:35:20,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:20,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:20,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {189#true} is VALID [2022-02-21 04:35:20,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {189#true} is VALID [2022-02-21 04:35:20,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#true} assume !(main_~length1~0#1 < 1); {189#true} is VALID [2022-02-21 04:35:20,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {189#true} assume !(main_~length2~0#1 < 1); {191#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:35:20,231 INFO L290 TraceCheckUtils]: 4: Hoare triple {191#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; {192#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:20,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {192#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~0#1 < main_~length2~0#1); {190#false} is VALID [2022-02-21 04:35:20,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {190#false} call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstpcpy } true;cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset, cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstpcpy_#res#1.base, cstpcpy_#res#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset, cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset, cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, cstpcpy_~from#1.base, cstpcpy_~from#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset; {190#false} is VALID [2022-02-21 04:35:20,233 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 04:35:20,233 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:20,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889796288] [2022-02-21 04:35:20,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889796288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:20,234 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:20,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:35:20,234 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035621305] [2022-02-21 04:35:20,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:20,238 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:20,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:20,239 INFO L85 PathProgramCache]: Analyzing trace with hash 66694, now seen corresponding path program 1 times [2022-02-21 04:35:20,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:20,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490732181] [2022-02-21 04:35:20,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:20,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:20,254 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:20,264 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:20,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:20,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:35:20,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:35:20,341 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:20,380 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 04:35:20,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:35:20,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:20,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2022-02-21 04:35:20,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:20,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2022-02-21 04:35:20,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 04:35:20,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 04:35:20,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2022-02-21 04:35:20,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:20,393 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-02-21 04:35:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2022-02-21 04:35:20,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-02-21 04:35:20,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:20,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,395 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,397 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:20,399 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 04:35:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-21 04:35:20,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:20,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:20,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 16 transitions. [2022-02-21 04:35:20,400 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 16 transitions. [2022-02-21 04:35:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:20,401 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 04:35:20,401 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-21 04:35:20,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:20,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:20,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:20,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-02-21 04:35:20,402 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 04:35:20,402 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 04:35:20,402 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:20,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-02-21 04:35:20,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:20,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:20,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:20,403 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:20,403 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:20,403 INFO L791 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 213#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 219#L521 assume !(main_~length1~0#1 < 1); 217#L521-2 assume !(main_~length2~0#1 < 1); 218#L524-1 assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 208#L531-3 assume !!(main_~i~0#1 < main_~length2~0#1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 209#L531-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 210#L531-3 assume !(main_~i~0#1 < main_~length2~0#1); 211#L531-4 call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstpcpy } true;cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset, cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstpcpy_#res#1.base, cstpcpy_#res#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset, cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset, cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, cstpcpy_~from#1.base, cstpcpy_~from#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset; 216#L515-4 [2022-02-21 04:35:20,404 INFO L793 eck$LassoCheckResult]: Loop: 216#L515-4 call cstpcpy_#t~mem4#1 := read~int(cstpcpy_~from#1.base, cstpcpy_~from#1.offset, 1);call write~int(cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, 1); 214#L515-1 assume !!(0 != cstpcpy_#t~mem4#1);havoc cstpcpy_#t~mem4#1; 215#L515-3 cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset;cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;havoc cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset; 216#L515-4 [2022-02-21 04:35:20,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1302257236, now seen corresponding path program 1 times [2022-02-21 04:35:20,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:20,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684949018] [2022-02-21 04:35:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:20,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:20,436 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:20,461 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:20,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:20,461 INFO L85 PathProgramCache]: Analyzing trace with hash 66694, now seen corresponding path program 2 times [2022-02-21 04:35:20,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:20,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649833656] [2022-02-21 04:35:20,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:20,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:20,467 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:20,471 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:20,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:20,471 INFO L85 PathProgramCache]: Analyzing trace with hash -894230189, now seen corresponding path program 1 times [2022-02-21 04:35:20,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:20,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251755903] [2022-02-21 04:35:20,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:20,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:20,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {253#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {253#true} is VALID [2022-02-21 04:35:20,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {253#true} is VALID [2022-02-21 04:35:20,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {253#true} assume !(main_~length1~0#1 < 1); {253#true} is VALID [2022-02-21 04:35:20,626 INFO L290 TraceCheckUtils]: 3: Hoare triple {253#true} assume !(main_~length2~0#1 < 1); {255#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:35:20,627 INFO L290 TraceCheckUtils]: 4: Hoare triple {255#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; {256#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:20,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !!(main_~i~0#1 < main_~length2~0#1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; {256#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:20,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {257#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (or (<= (+ |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1) (<= |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-21 04:35:20,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (or (<= (+ |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1) (<= |ULTIMATE.start_main_~i~0#1| 1)))} assume !(main_~i~0#1 < main_~length2~0#1); {258#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= (+ |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1))} is VALID [2022-02-21 04:35:20,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {258#(and (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= (+ |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1))} call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstpcpy } true;cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset, cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstpcpy_#res#1.base, cstpcpy_#res#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset, cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset, cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, cstpcpy_~from#1.base, cstpcpy_~from#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset; {259#(= (select (select |#memory_int| |ULTIMATE.start_cstpcpy_~from#1.base|) |ULTIMATE.start_cstpcpy_~from#1.offset|) 0)} is VALID [2022-02-21 04:35:20,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#(= (select (select |#memory_int| |ULTIMATE.start_cstpcpy_~from#1.base|) |ULTIMATE.start_cstpcpy_~from#1.offset|) 0)} call cstpcpy_#t~mem4#1 := read~int(cstpcpy_~from#1.base, cstpcpy_~from#1.offset, 1);call write~int(cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, 1); {260#(= |ULTIMATE.start_cstpcpy_#t~mem4#1| 0)} is VALID [2022-02-21 04:35:20,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {260#(= |ULTIMATE.start_cstpcpy_#t~mem4#1| 0)} assume !!(0 != cstpcpy_#t~mem4#1);havoc cstpcpy_#t~mem4#1; {254#false} is VALID [2022-02-21 04:35:20,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {254#false} cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset;cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;havoc cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset; {254#false} is VALID [2022-02-21 04:35:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:20,631 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:20,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251755903] [2022-02-21 04:35:20,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251755903] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:35:20,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888701063] [2022-02-21 04:35:20,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:20,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:20,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:20,633 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:35:20,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 04:35:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:20,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 04:35:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:20,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:20,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-02-21 04:35:21,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 04:35:21,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 04:35:21,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2022-02-21 04:35:21,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {253#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {253#true} is VALID [2022-02-21 04:35:21,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {253#true} is VALID [2022-02-21 04:35:21,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {253#true} assume !(main_~length1~0#1 < 1); {253#true} is VALID [2022-02-21 04:35:21,378 INFO L290 TraceCheckUtils]: 3: Hoare triple {253#true} assume !(main_~length2~0#1 < 1); {255#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:35:21,378 INFO L290 TraceCheckUtils]: 4: Hoare triple {255#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; {276#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:21,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {276#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !!(main_~i~0#1 < main_~length2~0#1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; {276#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:21,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {276#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {283#(and (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 04:35:21,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {283#(and (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~i~0#1 < main_~length2~0#1); {287#(and (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:21,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {287#(and (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstpcpy } true;cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset, cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstpcpy_#res#1.base, cstpcpy_#res#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset, cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset, cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, cstpcpy_~from#1.base, cstpcpy_~from#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset; {291#(exists ((|ULTIMATE.start_main_~nondetString~0#1.offset| Int) (|ULTIMATE.start_main_~length2~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_cstpcpy_~from#1.base|) (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (<= |ULTIMATE.start_cstpcpy_~from#1.offset| |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|)))} is VALID [2022-02-21 04:35:21,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {291#(exists ((|ULTIMATE.start_main_~nondetString~0#1.offset| Int) (|ULTIMATE.start_main_~length2~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_cstpcpy_~from#1.base|) (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (<= |ULTIMATE.start_cstpcpy_~from#1.offset| |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|)))} call cstpcpy_#t~mem4#1 := read~int(cstpcpy_~from#1.base, cstpcpy_~from#1.offset, 1);call write~int(cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, 1); {260#(= |ULTIMATE.start_cstpcpy_#t~mem4#1| 0)} is VALID [2022-02-21 04:35:21,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {260#(= |ULTIMATE.start_cstpcpy_#t~mem4#1| 0)} assume !!(0 != cstpcpy_#t~mem4#1);havoc cstpcpy_#t~mem4#1; {254#false} is VALID [2022-02-21 04:35:21,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {254#false} cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset;cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;havoc cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset; {254#false} is VALID [2022-02-21 04:35:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:21,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:35:21,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-02-21 04:35:21,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-02-21 04:35:21,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {254#false} cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset;cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;havoc cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset; {254#false} is VALID [2022-02-21 04:35:21,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {260#(= |ULTIMATE.start_cstpcpy_#t~mem4#1| 0)} assume !!(0 != cstpcpy_#t~mem4#1);havoc cstpcpy_#t~mem4#1; {254#false} is VALID [2022-02-21 04:35:21,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {307#(or (not (<= 0 |ULTIMATE.start_cstpcpy_~from#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpcpy_~from#1.base|) |ULTIMATE.start_cstpcpy_~from#1.offset|) 0))} call cstpcpy_#t~mem4#1 := read~int(cstpcpy_~from#1.base, cstpcpy_~from#1.offset, 1);call write~int(cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, 1); {260#(= |ULTIMATE.start_cstpcpy_#t~mem4#1| 0)} is VALID [2022-02-21 04:35:21,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {311#(and (or (< |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (or (< |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1)))} call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstpcpy } true;cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset, cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstpcpy_#res#1.base, cstpcpy_#res#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset, cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset, cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, cstpcpy_~from#1.base, cstpcpy_~from#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset; {307#(or (not (<= 0 |ULTIMATE.start_cstpcpy_~from#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_cstpcpy_~from#1.base|) |ULTIMATE.start_cstpcpy_~from#1.offset|) 0))} is VALID [2022-02-21 04:35:21,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(or (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~length2~0#1|) (and (or (< |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (or (< |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1))))} assume !(main_~i~0#1 < main_~length2~0#1); {311#(and (or (< |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (or (< |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1)))} is VALID [2022-02-21 04:35:21,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {319#(or (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (and (or (< |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (or (< |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1))))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {315#(or (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~length2~0#1|) (and (or (< |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (or (< |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1))))} is VALID [2022-02-21 04:35:21,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {319#(or (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (and (or (< |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (or (< |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1))))} assume !!(main_~i~0#1 < main_~length2~0#1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; {319#(or (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (and (or (< |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (or (< |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1))))} is VALID [2022-02-21 04:35:21,805 INFO L290 TraceCheckUtils]: 4: Hoare triple {255#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; {319#(or (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length2~0#1|) (and (or (< |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|)) (or (< |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) 1))))} is VALID [2022-02-21 04:35:21,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {253#true} assume !(main_~length2~0#1 < 1); {255#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:35:21,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {253#true} assume !(main_~length1~0#1 < 1); {253#true} is VALID [2022-02-21 04:35:21,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {253#true} is VALID [2022-02-21 04:35:21,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {253#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {253#true} is VALID [2022-02-21 04:35:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:21,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888701063] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:35:21,808 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:35:21,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-02-21 04:35:21,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262450072] [2022-02-21 04:35:21,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:35:21,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:21,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 04:35:21,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-02-21 04:35:21,874 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:22,119 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-21 04:35:22,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 04:35:22,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:22,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:22,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2022-02-21 04:35:22,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:22,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 19 transitions. [2022-02-21 04:35:22,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 04:35:22,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 04:35:22,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2022-02-21 04:35:22,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:22,148 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 04:35:22,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2022-02-21 04:35:22,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2022-02-21 04:35:22,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:22,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:22,149 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:22,149 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:22,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:22,150 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 04:35:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-21 04:35:22,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:22,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:22,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 19 transitions. [2022-02-21 04:35:22,150 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 19 transitions. [2022-02-21 04:35:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:22,151 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 04:35:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-21 04:35:22,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:22,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:22,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:22,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2022-02-21 04:35:22,152 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-02-21 04:35:22,152 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-02-21 04:35:22,152 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:22,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2022-02-21 04:35:22,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:22,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:22,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:22,153 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:22,153 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:22,153 INFO L791 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 367#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 374#L521 assume !(main_~length1~0#1 < 1); 372#L521-2 assume !(main_~length2~0#1 < 1); 373#L524-1 assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 362#L531-3 assume !!(main_~i~0#1 < main_~length2~0#1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 363#L531-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 364#L531-3 assume !!(main_~i~0#1 < main_~length2~0#1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 365#L531-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 375#L531-3 assume !(main_~i~0#1 < main_~length2~0#1); 371#L531-4 call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstpcpy } true;cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset, cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstpcpy_#res#1.base, cstpcpy_#res#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset, cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset, cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, cstpcpy_~from#1.base, cstpcpy_~from#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset; 370#L515-4 [2022-02-21 04:35:22,153 INFO L793 eck$LassoCheckResult]: Loop: 370#L515-4 call cstpcpy_#t~mem4#1 := read~int(cstpcpy_~from#1.base, cstpcpy_~from#1.offset, 1);call write~int(cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, 1); 368#L515-1 assume !!(0 != cstpcpy_#t~mem4#1);havoc cstpcpy_#t~mem4#1; 369#L515-3 cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset;cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;havoc cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset; 370#L515-4 [2022-02-21 04:35:22,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:22,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1633777206, now seen corresponding path program 2 times [2022-02-21 04:35:22,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:22,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560565227] [2022-02-21 04:35:22,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:22,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,200 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,211 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:22,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:22,212 INFO L85 PathProgramCache]: Analyzing trace with hash 66694, now seen corresponding path program 3 times [2022-02-21 04:35:22,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:22,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874035773] [2022-02-21 04:35:22,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:22,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,218 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,223 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:22,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:22,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1287382577, now seen corresponding path program 2 times [2022-02-21 04:35:22,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:22,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498002972] [2022-02-21 04:35:22,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:22,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,243 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:22,258 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:22,783 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:22,783 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:22,783 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:22,783 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:22,783 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:22,783 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:22,783 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:22,784 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:22,784 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpcpy-alloca-1.i_Iteration4_Lasso [2022-02-21 04:35:22,784 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:22,784 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:22,786 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 04:35:22,788 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 04:35:22,789 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 04:35:22,791 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 04:35:22,793 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 04:35:23,298 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:23,299 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:23,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 04:35:23,305 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 04:35:23,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 04:35:23,309 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 04:35:23,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 04:35:23,313 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 04:35:23,314 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 04:35:23,316 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 04:35:23,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,319 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 04:35:23,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,327 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 04:35:23,332 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 04:35:23,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:23,335 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 04:35:23,863 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:23,864 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:23,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,865 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 04:35:23,866 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 04:35:23,867 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 04:35:23,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:23,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:23,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:23,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:23,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:23,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:23,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:23,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:23,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 04:35:23,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,892 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 04:35:23,892 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 04:35:23,894 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 04:35:23,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:23,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:23,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:23,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:23,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:23,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:23,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:23,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:23,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:23,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,922 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 04:35:23,922 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 04:35:23,968 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 04:35:23,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:23,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:23,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:23,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:23,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:23,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:23,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:23,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:23,997 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 04:35:23,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:23,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:23,999 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 04:35:23,999 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 04:35:24,001 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 04:35:24,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:24,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:24,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 04:35:24,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,041 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 04:35:24,043 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 04:35:24,089 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 04:35:24,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:24,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:24,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,122 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 04:35:24,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,123 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 04:35:24,124 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 04:35:24,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:24,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:24,146 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:24,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:24,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,180 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 04:35:24,180 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 04:35:24,182 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 04:35:24,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:24,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:24,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,243 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 04:35:24,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,244 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 04:35:24,245 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 04:35:24,247 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 04:35:24,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:24,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:24,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,290 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 04:35:24,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,291 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 04:35:24,292 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 04:35:24,293 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 04:35:24,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:24,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:24,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:24,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:24,315 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 04:35:24,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,317 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 04:35:24,325 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 04:35:24,326 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 04:35:24,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:24,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:24,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:24,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:24,342 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:24,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:24,370 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:24,403 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-02-21 04:35:24,403 INFO L444 ModelExtractionUtils]: 26 out of 49 variables were initially zero. Simplification set additionally 18 variables to zero. [2022-02-21 04:35:24,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:24,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:24,405 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 04:35:24,405 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 04:35:24,406 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:24,413 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 04:35:24,413 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:24,413 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstpcpy_~from#1.offset) = -2*ULTIMATE.start_cstpcpy_~from#1.offset + 3 Supporting invariants [1*ULTIMATE.start_main_~length2~0#1 - 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_2 >= 0] [2022-02-21 04:35:24,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:24,540 INFO L297 tatePredicateManager]: 15 out of 19 supporting invariants were superfluous and have been removed [2022-02-21 04:35:24,550 INFO L390 LassoCheck]: Loop: "call cstpcpy_#t~mem4#1 := read~int(cstpcpy_~from#1.base, cstpcpy_~from#1.offset, 1);call write~int(cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, 1);" "assume !!(0 != cstpcpy_#t~mem4#1);havoc cstpcpy_#t~mem4#1;" "cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset;cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;havoc cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset;" [2022-02-21 04:35:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:24,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 04:35:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:24,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:24,652 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-21 04:35:24,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-21 04:35:24,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {417#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {417#unseeded} is VALID [2022-02-21 04:35:24,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {417#unseeded} is VALID [2022-02-21 04:35:24,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#unseeded} assume !(main_~length1~0#1 < 1); {417#unseeded} is VALID [2022-02-21 04:35:24,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {417#unseeded} assume !(main_~length2~0#1 < 1); {417#unseeded} is VALID [2022-02-21 04:35:24,809 INFO L290 TraceCheckUtils]: 4: Hoare triple {417#unseeded} assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; {550#(and (= |ULTIMATE.start_main_~i~0#1| 0) unseeded (<= (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} is VALID [2022-02-21 04:35:24,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {550#(and (= |ULTIMATE.start_main_~i~0#1| 0) unseeded (<= (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} assume !!(main_~i~0#1 < main_~length2~0#1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; {550#(and (= |ULTIMATE.start_main_~i~0#1| 0) unseeded (<= (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} is VALID [2022-02-21 04:35:24,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {550#(and (= |ULTIMATE.start_main_~i~0#1| 0) unseeded (<= (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {557#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) unseeded (<= (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} is VALID [2022-02-21 04:35:24,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {557#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) unseeded (<= (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} assume !!(main_~i~0#1 < main_~length2~0#1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; {561#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) unseeded (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~length2~0#1|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} is VALID [2022-02-21 04:35:24,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {561#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) unseeded (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~length2~0#1|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {565#(and (<= |ULTIMATE.start_main_~i~0#1| 2) unseeded (< 1 |ULTIMATE.start_main_~length2~0#1|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} is VALID [2022-02-21 04:35:24,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {565#(and (<= |ULTIMATE.start_main_~i~0#1| 2) unseeded (< 1 |ULTIMATE.start_main_~length2~0#1|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} assume !(main_~i~0#1 < main_~length2~0#1); {569#(and unseeded (< 1 |ULTIMATE.start_main_~length2~0#1|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) |ULTIMATE.start_main_~length2~0#1|) (<= |ULTIMATE.start_main_~length2~0#1| 2) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} is VALID [2022-02-21 04:35:24,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {569#(and unseeded (< 1 |ULTIMATE.start_main_~length2~0#1|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) |ULTIMATE.start_main_~length2~0#1|) (<= |ULTIMATE.start_main_~length2~0#1| 2) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstpcpy } true;cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset, cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstpcpy_#res#1.base, cstpcpy_#res#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset, cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset, cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, cstpcpy_~from#1.base, cstpcpy_~from#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset; {529#(and unseeded (= (+ (- 1) |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) (+ |ULTIMATE.start_main_~nondetString~0#1.offset| 1)) (>= (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|))) 0) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|) (= |ULTIMATE.start_cstpcpy_~from#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} is VALID [2022-02-21 04:35:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:24,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 04:35:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:24,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:24,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {530#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_cstpcpy_~from#1.offset|) 3)) (= (+ (- 1) |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) (+ |ULTIMATE.start_main_~nondetString~0#1.offset| 1)) (>= (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|))) 0) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|) (= |ULTIMATE.start_cstpcpy_~from#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} call cstpcpy_#t~mem4#1 := read~int(cstpcpy_~from#1.base, cstpcpy_~from#1.offset, 1);call write~int(cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, 1); {573#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_cstpcpy_~from#1.offset|) 3)) (<= (+ |ULTIMATE.start_cstpcpy_~from#1.offset| 1) (select |#length| |ULTIMATE.start_cstpcpy_~from#1.base|)) (= (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) (+ |ULTIMATE.start_main_~nondetString~0#1.offset| 1)) (>= (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|))) 0) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|) (= |ULTIMATE.start_cstpcpy_~from#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} is VALID [2022-02-21 04:35:24,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {573#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_cstpcpy_~from#1.offset|) 3)) (<= (+ |ULTIMATE.start_cstpcpy_~from#1.offset| 1) (select |#length| |ULTIMATE.start_cstpcpy_~from#1.base|)) (= (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) (+ |ULTIMATE.start_main_~nondetString~0#1.offset| 1)) (>= (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|))) 0) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|) (= |ULTIMATE.start_cstpcpy_~from#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} assume !!(0 != cstpcpy_#t~mem4#1);havoc cstpcpy_#t~mem4#1; {573#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_cstpcpy_~from#1.offset|) 3)) (<= (+ |ULTIMATE.start_cstpcpy_~from#1.offset| 1) (select |#length| |ULTIMATE.start_cstpcpy_~from#1.base|)) (= (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) (+ |ULTIMATE.start_main_~nondetString~0#1.offset| 1)) (>= (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|))) 0) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|) (= |ULTIMATE.start_cstpcpy_~from#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} is VALID [2022-02-21 04:35:24,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {573#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_cstpcpy_~from#1.offset|) 3)) (<= (+ |ULTIMATE.start_cstpcpy_~from#1.offset| 1) (select |#length| |ULTIMATE.start_cstpcpy_~from#1.base|)) (= (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |ULTIMATE.start_main_~nondetString~0#1.offset|) (+ |ULTIMATE.start_main_~nondetString~0#1.offset| 1)) (>= (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|))) 0) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|) (= |ULTIMATE.start_cstpcpy_~from#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset;cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;havoc cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset; {532#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_cstpcpy_~from#1.offset|) 3)))) (= (+ (- 1) |ULTIMATE.start_main_~nondetString~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) (+ |ULTIMATE.start_main_~nondetString~0#1.offset| 1)) (>= (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|))) 0) (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|) (= |ULTIMATE.start_cstpcpy_~from#1.base| |ULTIMATE.start_main_~nondetString~0#1.base|))} is VALID [2022-02-21 04:35:24,889 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 04:35:24,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:24,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:24,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:24,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:24,905 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2022-02-21 04:35:24,905 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,059 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 31 transitions. Complement of second has 11 states. [2022-02-21 04:35:25,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2022-02-21 04:35:25,059 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:25,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:25,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:25,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:25,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:25,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:25,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:25,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2022-02-21 04:35:25,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:25,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:25,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:25,061 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:25,061 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:25,061 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:25,062 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:25,062 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 31 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:25,063 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:25,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:25,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:25,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:25,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:25,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:25,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:25,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 26 letters. Loop has 26 letters. [2022-02-21 04:35:25,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 04:35:25,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 26 letters. [2022-02-21 04:35:25,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 14 letters. [2022-02-21 04:35:25,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 14 letters. [2022-02-21 04:35:25,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 14 letters. [2022-02-21 04:35:25,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:35:25,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:35:25,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:35:25,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:25,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:25,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:25,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:25,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:25,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:25,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:25,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:25,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:25,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:25,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:25,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:25,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:25,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:25,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:25,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:25,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:25,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:25,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,072 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2022-02-21 04:35:25,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:25,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:35:25,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 11 letters. Loop has 6 letters. [2022-02-21 04:35:25,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:25,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:25,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:25,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 19 states and 22 transitions. [2022-02-21 04:35:25,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 04:35:25,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 04:35:25,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2022-02-21 04:35:25,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:25,076 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-02-21 04:35:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2022-02-21 04:35:25,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2022-02-21 04:35:25,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:25,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,079 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,079 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:25,080 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-21 04:35:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-21 04:35:25,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:25,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:25,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 22 transitions. [2022-02-21 04:35:25,081 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 22 transitions. [2022-02-21 04:35:25,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:25,083 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-21 04:35:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-21 04:35:25,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:25,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:25,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:25,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:25,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-21 04:35:25,084 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 04:35:25,084 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 04:35:25,084 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:35:25,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-02-21 04:35:25,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:25,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:25,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:25,085 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:25,085 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:25,085 INFO L791 eck$LassoCheckResult]: Stem: 634#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 635#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 643#L521 assume !(main_~length1~0#1 < 1); 640#L521-2 assume !(main_~length2~0#1 < 1); 641#L524-1 assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 630#L531-3 assume !!(main_~i~0#1 < main_~length2~0#1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 631#L531-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 636#L531-3 assume !!(main_~i~0#1 < main_~length2~0#1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 645#L531-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 632#L531-3 assume !!(main_~i~0#1 < main_~length2~0#1);call write~int(main_#t~nondet10#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 633#L531-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 644#L531-3 assume !(main_~i~0#1 < main_~length2~0#1); 642#L531-4 call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstpcpy } true;cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset, cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstpcpy_#res#1.base, cstpcpy_#res#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset, cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset, cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, cstpcpy_~from#1.base, cstpcpy_~from#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset; 639#L515-4 [2022-02-21 04:35:25,085 INFO L793 eck$LassoCheckResult]: Loop: 639#L515-4 call cstpcpy_#t~mem4#1 := read~int(cstpcpy_~from#1.base, cstpcpy_~from#1.offset, 1);call write~int(cstpcpy_#t~mem4#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, 1); 637#L515-1 assume !!(0 != cstpcpy_#t~mem4#1);havoc cstpcpy_#t~mem4#1; 638#L515-3 cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;havoc cstpcpy_#t~pre2#1.base, cstpcpy_#t~pre2#1.offset;cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;havoc cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset; 639#L515-4 [2022-02-21 04:35:25,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:25,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1898078824, now seen corresponding path program 3 times [2022-02-21 04:35:25,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:25,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115201788] [2022-02-21 04:35:25,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:25,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,103 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,119 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:25,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:25,127 INFO L85 PathProgramCache]: Analyzing trace with hash 66694, now seen corresponding path program 4 times [2022-02-21 04:35:25,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:25,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66998132] [2022-02-21 04:35:25,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:25,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,135 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,140 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:25,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1873210255, now seen corresponding path program 3 times [2022-02-21 04:35:25,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:25,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544308801] [2022-02-21 04:35:25,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:25,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,183 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:25,193 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:25,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:25,912 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:25,913 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:25,913 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:25,913 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:25,913 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:25,913 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:25,913 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:25,913 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:25,913 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpcpy-alloca-1.i_Iteration5_Lasso [2022-02-21 04:35:25,913 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:25,913 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:25,916 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 04:35:25,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:25,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:26,352 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString~0#1.base) (+ (- 1) ULTIMATE.start_main_~length2~0#1 ULTIMATE.start_main_~nondetString~0#1.offset))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 04:35:26,357 INFO L158 Benchmark]: Toolchain (without parser) took 8688.11ms. Allocated memory was 109.1MB in the beginning and 174.1MB in the end (delta: 65.0MB). Free memory was 71.5MB in the beginning and 127.1MB in the end (delta: -55.6MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. [2022-02-21 04:35:26,357 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:26,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.60ms. Allocated memory is still 109.1MB. Free memory was 71.3MB in the beginning and 77.4MB in the end (delta: -6.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:35:26,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.83ms. Allocated memory is still 109.1MB. Free memory was 77.4MB in the beginning and 75.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:26,358 INFO L158 Benchmark]: Boogie Preprocessor took 37.23ms. Allocated memory is still 109.1MB. Free memory was 75.3MB in the beginning and 74.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:26,359 INFO L158 Benchmark]: RCFGBuilder took 280.83ms. Allocated memory is still 109.1MB. Free memory was 74.1MB in the beginning and 62.2MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:35:26,359 INFO L158 Benchmark]: BuchiAutomizer took 8043.55ms. Allocated memory was 109.1MB in the beginning and 174.1MB in the end (delta: 65.0MB). Free memory was 62.0MB in the beginning and 127.1MB in the end (delta: -65.1MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. [2022-02-21 04:35:26,361 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.17ms. Allocated memory is still 109.1MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.60ms. Allocated memory is still 109.1MB. Free memory was 71.3MB in the beginning and 77.4MB in the end (delta: -6.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.83ms. Allocated memory is still 109.1MB. Free memory was 77.4MB in the beginning and 75.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.23ms. Allocated memory is still 109.1MB. Free memory was 75.3MB in the beginning and 74.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 280.83ms. Allocated memory is still 109.1MB. Free memory was 74.1MB in the beginning and 62.2MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 8043.55ms. Allocated memory was 109.1MB in the beginning and 174.1MB in the end (delta: 65.0MB). Free memory was 62.0MB in the beginning and 127.1MB in the end (delta: -65.1MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString~0#1.base) (+ (- 1) ULTIMATE.start_main_~length2~0#1 ULTIMATE.start_main_~nondetString~0#1.offset))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString~0#1.base) (+ (- 1) ULTIMATE.start_main_~length2~0#1 ULTIMATE.start_main_~nondetString~0#1.offset))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 04:35:26,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:26,591 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString~0#1.base) (+ (- 1) ULTIMATE.start_main_~length2~0#1 ULTIMATE.start_main_~nondetString~0#1.offset))_1 was not added to the transformula!