./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cmemset-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cmemset-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eba94063d18105b44b9503ed48a138d00b9b850cd51aae19571aab60c15e268e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:40:35,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:40:35,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:40:35,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:40:35,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:40:35,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:40:35,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:40:35,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:40:35,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:40:35,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:40:35,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:40:35,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:40:35,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:40:35,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:40:35,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:40:35,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:40:35,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:40:35,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:40:35,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:40:35,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:40:35,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:40:35,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:40:35,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:40:35,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:40:35,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:40:35,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:40:35,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:40:35,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:40:35,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:40:35,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:40:35,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:40:35,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:40:35,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:40:35,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:40:35,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:40:35,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:40:35,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:40:35,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:40:35,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:40:35,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:40:35,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:40:35,262 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:40:35,279 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:40:35,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:40:35,280 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:40:35,281 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:40:35,281 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:40:35,281 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:40:35,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:40:35,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:40:35,282 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:40:35,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:40:35,282 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:40:35,282 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:40:35,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:40:35,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:40:35,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:40:35,283 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:40:35,283 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:40:35,283 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:40:35,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:40:35,284 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:40:35,284 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:40:35,284 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:40:35,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:40:35,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:40:35,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:40:35,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:40:35,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:40:35,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:40:35,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:40:35,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:40:35,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> eba94063d18105b44b9503ed48a138d00b9b850cd51aae19571aab60c15e268e [2022-02-20 23:40:35,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:40:35,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:40:35,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:40:35,465 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:40:35,476 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:40:35,477 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cmemset-alloca-1.i [2022-02-20 23:40:35,523 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10c6d1a9/2d4c5250d6c942d5a9b94b12d0b4c50a/FLAGd40b47b85 [2022-02-20 23:40:35,929 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:40:35,929 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cmemset-alloca-1.i [2022-02-20 23:40:35,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10c6d1a9/2d4c5250d6c942d5a9b94b12d0b4c50a/FLAGd40b47b85 [2022-02-20 23:40:35,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10c6d1a9/2d4c5250d6c942d5a9b94b12d0b4c50a [2022-02-20 23:40:35,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:40:35,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:40:35,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:40:35,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:40:35,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:40:35,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:40:35" (1/1) ... [2022-02-20 23:40:35,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b1d3df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:35, skipping insertion in model container [2022-02-20 23:40:35,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:40:35" (1/1) ... [2022-02-20 23:40:35,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:40:35,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:40:36,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:40:36,265 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:40:36,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:40:36,322 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:40:36,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:36 WrapperNode [2022-02-20 23:40:36,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:40:36,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:40:36,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:40:36,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:40:36,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:36" (1/1) ... [2022-02-20 23:40:36,352 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:36" (1/1) ... [2022-02-20 23:40:36,378 INFO L137 Inliner]: procedures = 116, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-02-20 23:40:36,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:40:36,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:40:36,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:40:36,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:40:36,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:36" (1/1) ... [2022-02-20 23:40:36,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:36" (1/1) ... [2022-02-20 23:40:36,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:36" (1/1) ... [2022-02-20 23:40:36,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:36" (1/1) ... [2022-02-20 23:40:36,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:36" (1/1) ... [2022-02-20 23:40:36,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:36" (1/1) ... [2022-02-20 23:40:36,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:36" (1/1) ... [2022-02-20 23:40:36,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:40:36,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:40:36,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:40:36,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:40:36,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:36" (1/1) ... [2022-02-20 23:40:36,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:40:36,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:40:36,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:40:36,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:40:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:40:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:40:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:40:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:40:36,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:40:36,535 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:40:36,536 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:40:36,707 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:40:36,711 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:40:36,712 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 23:40:36,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:40:36 BoogieIcfgContainer [2022-02-20 23:40:36,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:40:36,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:40:36,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:40:36,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:40:36,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:40:35" (1/3) ... [2022-02-20 23:40:36,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc410b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:40:36, skipping insertion in model container [2022-02-20 23:40:36,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:36" (2/3) ... [2022-02-20 23:40:36,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc410b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:40:36, skipping insertion in model container [2022-02-20 23:40:36,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:40:36" (3/3) ... [2022-02-20 23:40:36,725 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cmemset-alloca-1.i [2022-02-20 23:40:36,737 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:40:36,737 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-02-20 23:40:36,790 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:40:36,800 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:40:36,800 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 23:40:36,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 18 states have internal predecessors, (23), 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-20 23:40:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:40:36,824 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:36,825 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:36,825 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:40:36,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:36,830 INFO L85 PathProgramCache]: Analyzing trace with hash 121322254, now seen corresponding path program 1 times [2022-02-20 23:40:36,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:36,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455624569] [2022-02-20 23:40:36,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:36,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:37,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {22#true} is VALID [2022-02-20 23:40:37,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~ret8#1.base, main_#t~ret8#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~length~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~c~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {22#true} is VALID [2022-02-20 23:40:37,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {22#true} is VALID [2022-02-20 23:40:37,106 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#true} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {24#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 23:40:37,108 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;assume { :begin_inline_cmemset } true;cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset, cmemset_#in~c#1, cmemset_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemset_#res#1.base, cmemset_#res#1.offset;havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, cmemset_#t~pre2#1, cmemset_~d~0#1.base, cmemset_~d~0#1.offset, cmemset_~dst#1.base, cmemset_~dst#1.offset, cmemset_~c#1, cmemset_~n#1;cmemset_~dst#1.base, cmemset_~dst#1.offset := cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset;cmemset_~c#1 := cmemset_#in~c#1;cmemset_~n#1 := cmemset_#in~n#1; {25#(= (select |#valid| |ULTIMATE.start_cmemset_~dst#1.base|) 1)} is VALID [2022-02-20 23:40:37,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#(= (select |#valid| |ULTIMATE.start_cmemset_~dst#1.base|) 1)} assume 0 != cmemset_~n#1 % 4294967296;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_~dst#1.base, cmemset_~dst#1.offset; {26#(= (select |#valid| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)} is VALID [2022-02-20 23:40:37,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#(= (select |#valid| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {27#(= (select |#valid| |ULTIMATE.start_cmemset_#t~post3#1.base|) 1)} is VALID [2022-02-20 23:40:37,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#(= (select |#valid| |ULTIMATE.start_cmemset_#t~post3#1.base|) 1)} assume !(1 == #valid[cmemset_#t~post3#1.base]); {23#false} is VALID [2022-02-20 23:40:37,112 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-20 23:40:37,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:37,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455624569] [2022-02-20 23:40:37,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455624569] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:37,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:37,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:40:37,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574461360] [2022-02-20 23:40:37,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:37,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:40:37,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:37,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:37,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:40:37,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:37,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:40:37,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:40:37,157 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 18 states have internal predecessors, (23), 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 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:37,363 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-02-20 23:40:37,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:40:37,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:40:37,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-02-20 23:40:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-02-20 23:40:37,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-02-20 23:40:37,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:37,416 INFO L225 Difference]: With dead ends: 36 [2022-02-20 23:40:37,416 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 23:40:37,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:40:37,420 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 49 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:37,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 45 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:37,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 23:40:37,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 16. [2022-02-20 23:40:37,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:37,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 16 states, 14 states have (on average 1.3571428571428572) 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-20 23:40:37,439 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 16 states, 14 states have (on average 1.3571428571428572) 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-20 23:40:37,439 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 16 states, 14 states have (on average 1.3571428571428572) 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-20 23:40:37,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:37,441 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-20 23:40:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-20 23:40:37,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:37,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:37,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 14 states have (on average 1.3571428571428572) 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 32 states. [2022-02-20 23:40:37,442 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.3571428571428572) 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 32 states. [2022-02-20 23:40:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:37,444 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-20 23:40:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-20 23:40:37,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:37,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:37,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:37,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:37,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.3571428571428572) 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-20 23:40:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-20 23:40:37,447 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 8 [2022-02-20 23:40:37,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:37,447 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-20 23:40:37,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,448 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 23:40:37,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:40:37,448 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:37,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:37,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:40:37,448 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:40:37,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:37,449 INFO L85 PathProgramCache]: Analyzing trace with hash 121322255, now seen corresponding path program 1 times [2022-02-20 23:40:37,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:37,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812088679] [2022-02-20 23:40:37,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:37,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {156#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {156#true} is VALID [2022-02-20 23:40:37,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~ret8#1.base, main_#t~ret8#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~length~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~c~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {156#true} is VALID [2022-02-20 23:40:37,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {156#true} is VALID [2022-02-20 23:40:37,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {156#true} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {158#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:40:37,536 INFO L290 TraceCheckUtils]: 4: Hoare triple {158#(<= 1 |ULTIMATE.start_main_~n~0#1|)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;assume { :begin_inline_cmemset } true;cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset, cmemset_#in~c#1, cmemset_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemset_#res#1.base, cmemset_#res#1.offset;havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, cmemset_#t~pre2#1, cmemset_~d~0#1.base, cmemset_~d~0#1.offset, cmemset_~dst#1.base, cmemset_~dst#1.offset, cmemset_~c#1, cmemset_~n#1;cmemset_~dst#1.base, cmemset_~dst#1.offset := cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset;cmemset_~c#1 := cmemset_#in~c#1;cmemset_~n#1 := cmemset_#in~n#1; {159#(and (<= 1 (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (= |ULTIMATE.start_cmemset_~dst#1.offset| 0))} is VALID [2022-02-20 23:40:37,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#(and (<= 1 (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (= |ULTIMATE.start_cmemset_~dst#1.offset| 0))} assume 0 != cmemset_~n#1 % 4294967296;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_~dst#1.base, cmemset_~dst#1.offset; {160#(and (<= 1 (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= |ULTIMATE.start_cmemset_~d~0#1.offset| 0))} is VALID [2022-02-20 23:40:37,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {160#(and (<= 1 (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= |ULTIMATE.start_cmemset_~d~0#1.offset| 0))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {161#(and (<= 1 (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) (= |ULTIMATE.start_cmemset_#t~post3#1.offset| 0))} is VALID [2022-02-20 23:40:37,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {161#(and (<= 1 (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) (= |ULTIMATE.start_cmemset_#t~post3#1.offset| 0))} assume !(1 + cmemset_#t~post3#1.offset <= #length[cmemset_#t~post3#1.base] && 0 <= cmemset_#t~post3#1.offset); {157#false} is VALID [2022-02-20 23:40:37,538 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-20 23:40:37,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:37,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812088679] [2022-02-20 23:40:37,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812088679] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:37,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:37,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:40:37,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013578898] [2022-02-20 23:40:37,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:37,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:40:37,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:37,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:37,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:40:37,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:37,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:40:37,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:40:37,549 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:37,638 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-20 23:40:37,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:40:37,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:40:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 23:40:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 23:40:37,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-02-20 23:40:37,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:37,657 INFO L225 Difference]: With dead ends: 19 [2022-02-20 23:40:37,657 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 23:40:37,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:40:37,659 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:37,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 47 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:40:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 23:40:37,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-02-20 23:40:37,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:37,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,662 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,662 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:37,663 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-20 23:40:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 23:40:37,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:37,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:37,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 23:40:37,664 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 23:40:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:37,665 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-20 23:40:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 23:40:37,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:37,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:37,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:37,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-02-20 23:40:37,667 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 8 [2022-02-20 23:40:37,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:37,667 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-20 23:40:37,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 23:40:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:40:37,668 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:37,668 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:37,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:40:37,668 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:40:37,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:37,669 INFO L85 PathProgramCache]: Analyzing trace with hash -533363702, now seen corresponding path program 1 times [2022-02-20 23:40:37,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:37,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304278567] [2022-02-20 23:40:37,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:37,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:37,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {245#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {245#true} is VALID [2022-02-20 23:40:37,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~ret8#1.base, main_#t~ret8#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~length~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~c~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {245#true} is VALID [2022-02-20 23:40:37,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {245#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {245#true} is VALID [2022-02-20 23:40:37,760 INFO L290 TraceCheckUtils]: 3: Hoare triple {245#true} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {247#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 23:40:37,762 INFO L290 TraceCheckUtils]: 4: Hoare triple {247#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;assume { :begin_inline_cmemset } true;cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset, cmemset_#in~c#1, cmemset_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemset_#res#1.base, cmemset_#res#1.offset;havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, cmemset_#t~pre2#1, cmemset_~d~0#1.base, cmemset_~d~0#1.offset, cmemset_~dst#1.base, cmemset_~dst#1.offset, cmemset_~c#1, cmemset_~n#1;cmemset_~dst#1.base, cmemset_~dst#1.offset := cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset;cmemset_~c#1 := cmemset_#in~c#1;cmemset_~n#1 := cmemset_#in~n#1; {248#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= (div |ULTIMATE.start_cmemset_~n#1| 4294967296) 0))} is VALID [2022-02-20 23:40:37,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {248#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= (div |ULTIMATE.start_cmemset_~n#1| 4294967296) 0))} assume !(0 != cmemset_~n#1 % 4294967296); {246#false} is VALID [2022-02-20 23:40:37,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {246#false} cmemset_#res#1.base, cmemset_#res#1.offset := cmemset_~dst#1.base, cmemset_~dst#1.offset; {246#false} is VALID [2022-02-20 23:40:37,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#false} main_#t~ret8#1.base, main_#t~ret8#1.offset := cmemset_#res#1.base, cmemset_#res#1.offset;assume { :end_inline_cmemset } true;havoc main_#t~ret8#1.base, main_#t~ret8#1.offset;main_#res#1 := 0;call ULTIMATE.dealloc(main_#t~malloc7#1.base, main_#t~malloc7#1.offset);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {246#false} is VALID [2022-02-20 23:40:37,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#false} assume !(#valid == main_old_#valid#1); {246#false} is VALID [2022-02-20 23:40:37,763 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-20 23:40:37,763 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:37,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304278567] [2022-02-20 23:40:37,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304278567] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:37,764 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:37,764 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:40:37,764 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099721971] [2022-02-20 23:40:37,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:37,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:40:37,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:37,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:37,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:40:37,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:37,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:40:37,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:40:37,773 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:37,839 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-02-20 23:40:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:40:37,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:40:37,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-02-20 23:40:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-02-20 23:40:37,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2022-02-20 23:40:37,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:37,870 INFO L225 Difference]: With dead ends: 34 [2022-02-20 23:40:37,870 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 23:40:37,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:40:37,871 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:37,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 55 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:40:37,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 23:40:37,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2022-02-20 23:40:37,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:37,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 20 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 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-20 23:40:37,874 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 20 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 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-20 23:40:37,874 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 20 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 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-20 23:40:37,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:37,875 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-02-20 23:40:37,875 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-02-20 23:40:37,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:37,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:37,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 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 34 states. [2022-02-20 23:40:37,876 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 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 34 states. [2022-02-20 23:40:37,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:37,877 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-02-20 23:40:37,877 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-02-20 23:40:37,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:37,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:37,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:37,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 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-20 23:40:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-02-20 23:40:37,879 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2022-02-20 23:40:37,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:37,879 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-02-20 23:40:37,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 23:40:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:40:37,880 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:37,880 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:37,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:40:37,880 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:40:37,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:37,881 INFO L85 PathProgramCache]: Analyzing trace with hash -476105400, now seen corresponding path program 1 times [2022-02-20 23:40:37,881 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:37,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024631971] [2022-02-20 23:40:37,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:37,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:37,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {375#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {375#true} is VALID [2022-02-20 23:40:37,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {375#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~ret8#1.base, main_#t~ret8#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~length~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~c~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {377#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-20 23:40:37,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {377#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-20 23:40:37,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {377#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~n~0#1 < 1); {378#(and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 23:40:37,967 INFO L290 TraceCheckUtils]: 4: Hoare triple {378#(and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~n~0#1|))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;assume { :begin_inline_cmemset } true;cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset, cmemset_#in~c#1, cmemset_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemset_#res#1.base, cmemset_#res#1.offset;havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, cmemset_#t~pre2#1, cmemset_~d~0#1.base, cmemset_~d~0#1.offset, cmemset_~dst#1.base, cmemset_~dst#1.offset, cmemset_~c#1, cmemset_~n#1;cmemset_~dst#1.base, cmemset_~dst#1.offset := cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset;cmemset_~c#1 := cmemset_#in~c#1;cmemset_~n#1 := cmemset_#in~n#1; {379#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= (div |ULTIMATE.start_cmemset_~n#1| 4294967296) 0))} is VALID [2022-02-20 23:40:37,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= (div |ULTIMATE.start_cmemset_~n#1| 4294967296) 0))} assume !(0 != cmemset_~n#1 % 4294967296); {376#false} is VALID [2022-02-20 23:40:37,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {376#false} cmemset_#res#1.base, cmemset_#res#1.offset := cmemset_~dst#1.base, cmemset_~dst#1.offset; {376#false} is VALID [2022-02-20 23:40:37,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#false} main_#t~ret8#1.base, main_#t~ret8#1.offset := cmemset_#res#1.base, cmemset_#res#1.offset;assume { :end_inline_cmemset } true;havoc main_#t~ret8#1.base, main_#t~ret8#1.offset;main_#res#1 := 0;call ULTIMATE.dealloc(main_#t~malloc7#1.base, main_#t~malloc7#1.offset);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {376#false} is VALID [2022-02-20 23:40:37,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#false} assume !(#valid == main_old_#valid#1); {376#false} is VALID [2022-02-20 23:40:37,968 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-20 23:40:37,968 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:37,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024631971] [2022-02-20 23:40:37,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024631971] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:37,969 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:37,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:40:37,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680789407] [2022-02-20 23:40:37,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:37,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:40:37,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:37,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:37,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:37,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:40:37,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:37,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:40:37,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:40:37,980 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:38,029 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 23:40:38,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:40:38,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:40:38,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-02-20 23:40:38,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-02-20 23:40:38,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2022-02-20 23:40:38,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:38,056 INFO L225 Difference]: With dead ends: 22 [2022-02-20 23:40:38,056 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 23:40:38,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:40:38,057 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:38,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:40:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 23:40:38,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-02-20 23:40:38,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:38,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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-20 23:40:38,059 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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-20 23:40:38,060 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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-20 23:40:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:38,065 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 23:40:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 23:40:38,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:38,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:38,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 22 states. [2022-02-20 23:40:38,065 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 22 states. [2022-02-20 23:40:38,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:38,070 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 23:40:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 23:40:38,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:38,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:38,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:38,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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-20 23:40:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-02-20 23:40:38,071 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2022-02-20 23:40:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:38,071 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-02-20 23:40:38,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 23:40:38,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:40:38,073 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:38,073 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:38,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:40:38,073 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:40:38,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:38,075 INFO L85 PathProgramCache]: Analyzing trace with hash 188498229, now seen corresponding path program 1 times [2022-02-20 23:40:38,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:38,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894425383] [2022-02-20 23:40:38,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:38,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:38,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {468#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {468#true} is VALID [2022-02-20 23:40:38,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~ret8#1.base, main_#t~ret8#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~length~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~c~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {468#true} is VALID [2022-02-20 23:40:38,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {468#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {468#true} is VALID [2022-02-20 23:40:38,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {468#true} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {470#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 23:40:38,175 INFO L290 TraceCheckUtils]: 4: Hoare triple {470#(and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;assume { :begin_inline_cmemset } true;cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset, cmemset_#in~c#1, cmemset_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemset_#res#1.base, cmemset_#res#1.offset;havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, cmemset_#t~pre2#1, cmemset_~d~0#1.base, cmemset_~d~0#1.offset, cmemset_~dst#1.base, cmemset_~dst#1.offset, cmemset_~c#1, cmemset_~n#1;cmemset_~dst#1.base, cmemset_~dst#1.offset := cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset;cmemset_~c#1 := cmemset_#in~c#1;cmemset_~n#1 := cmemset_#in~n#1; {471#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| 1))} is VALID [2022-02-20 23:40:38,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| 1))} assume 0 != cmemset_~n#1 % 4294967296;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_~dst#1.base, cmemset_~dst#1.offset; {471#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| 1))} is VALID [2022-02-20 23:40:38,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {471#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| 1))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {471#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| 1))} is VALID [2022-02-20 23:40:38,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| 1))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {471#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| 1))} is VALID [2022-02-20 23:40:38,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| 1))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {471#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| 1))} is VALID [2022-02-20 23:40:38,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| 1))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {472#(and (<= 0 |ULTIMATE.start_cmemset_#t~pre2#1|) (<= |ULTIMATE.start_cmemset_#t~pre2#1| (* (div |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296) 4294967296)))} is VALID [2022-02-20 23:40:38,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {472#(and (<= 0 |ULTIMATE.start_cmemset_#t~pre2#1|) (<= |ULTIMATE.start_cmemset_#t~pre2#1| (* (div |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296) 4294967296)))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {469#false} is VALID [2022-02-20 23:40:38,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {469#false} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {469#false} is VALID [2022-02-20 23:40:38,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {469#false} assume !(1 + cmemset_#t~post3#1.offset <= #length[cmemset_#t~post3#1.base] && 0 <= cmemset_#t~post3#1.offset); {469#false} is VALID [2022-02-20 23:40:38,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:38,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:38,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894425383] [2022-02-20 23:40:38,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894425383] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:38,179 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:38,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:40:38,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874588418] [2022-02-20 23:40:38,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:38,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:40:38,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:38,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:38,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:38,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:40:38,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:38,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:40:38,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:40:38,200 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:38,274 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-02-20 23:40:38,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:40:38,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:40:38,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-02-20 23:40:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-02-20 23:40:38,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2022-02-20 23:40:38,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:38,298 INFO L225 Difference]: With dead ends: 29 [2022-02-20 23:40:38,298 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 23:40:38,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:40:38,299 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:38,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 55 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:40:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 23:40:38,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-02-20 23:40:38,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:38,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:38,301 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:38,301 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:38,302 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-02-20 23:40:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-02-20 23:40:38,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:38,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:38,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 23:40:38,319 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 23:40:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:38,320 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-02-20 23:40:38,320 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-02-20 23:40:38,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:38,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:38,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:38,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-02-20 23:40:38,322 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2022-02-20 23:40:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:38,322 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-02-20 23:40:38,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:38,322 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-02-20 23:40:38,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:40:38,322 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:38,322 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:38,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:40:38,323 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:40:38,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:38,323 INFO L85 PathProgramCache]: Analyzing trace with hash -204528781, now seen corresponding path program 1 times [2022-02-20 23:40:38,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:38,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269498708] [2022-02-20 23:40:38,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:38,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:38,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {591#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {591#true} is VALID [2022-02-20 23:40:38,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {591#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~ret8#1.base, main_#t~ret8#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~length~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~c~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {591#true} is VALID [2022-02-20 23:40:38,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {591#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {591#true} is VALID [2022-02-20 23:40:38,569 INFO L290 TraceCheckUtils]: 3: Hoare triple {591#true} assume !(main_~n~0#1 < 1); {593#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:40:38,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {593#(<= 1 |ULTIMATE.start_main_~n~0#1|)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;assume { :begin_inline_cmemset } true;cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset, cmemset_#in~c#1, cmemset_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemset_#res#1.base, cmemset_#res#1.offset;havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, cmemset_#t~pre2#1, cmemset_~d~0#1.base, cmemset_~d~0#1.offset, cmemset_~dst#1.base, cmemset_~dst#1.offset, cmemset_~c#1, cmemset_~n#1;cmemset_~dst#1.base, cmemset_~dst#1.offset := cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset;cmemset_~c#1 := cmemset_#in~c#1;cmemset_~n#1 := cmemset_#in~n#1; {594#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (= |ULTIMATE.start_cmemset_~dst#1.offset| 0))} is VALID [2022-02-20 23:40:38,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {594#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (= |ULTIMATE.start_cmemset_~dst#1.offset| 0))} assume 0 != cmemset_~n#1 % 4294967296;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_~dst#1.base, cmemset_~dst#1.offset; {595#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= |ULTIMATE.start_cmemset_~d~0#1.offset| 0))} is VALID [2022-02-20 23:40:38,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= |ULTIMATE.start_cmemset_~d~0#1.offset| 0))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {596#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (= |ULTIMATE.start_cmemset_#t~post3#1.offset| 0) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)))} is VALID [2022-02-20 23:40:38,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (= |ULTIMATE.start_cmemset_#t~post3#1.offset| 0) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {597#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)))} is VALID [2022-02-20 23:40:38,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {597#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {597#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)))} is VALID [2022-02-20 23:40:38,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {597#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {598#(and (or (<= |ULTIMATE.start_cmemset_#t~pre2#1| (* (div |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296) 4294967296)) (<= (+ |ULTIMATE.start_cmemset_#t~pre2#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= 0 |ULTIMATE.start_cmemset_#t~pre2#1|))} is VALID [2022-02-20 23:40:38,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {598#(and (or (<= |ULTIMATE.start_cmemset_#t~pre2#1| (* (div |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296) 4294967296)) (<= (+ |ULTIMATE.start_cmemset_#t~pre2#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= 0 |ULTIMATE.start_cmemset_#t~pre2#1|))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {599#(and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:38,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {599#(and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {600#(and (<= 1 |ULTIMATE.start_cmemset_#t~post3#1.offset|) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)))} is VALID [2022-02-20 23:40:38,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {600#(and (<= 1 |ULTIMATE.start_cmemset_#t~post3#1.offset|) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)))} assume !(1 + cmemset_#t~post3#1.offset <= #length[cmemset_#t~post3#1.base] && 0 <= cmemset_#t~post3#1.offset); {592#false} is VALID [2022-02-20 23:40:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:38,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:38,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269498708] [2022-02-20 23:40:38,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269498708] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:40:38,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624669303] [2022-02-20 23:40:38,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:38,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:40:38,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:40:38,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:40:38,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:40:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:38,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-20 23:40:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:38,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:38,873 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:40:39,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {591#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {591#true} is VALID [2022-02-20 23:40:39,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {591#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~ret8#1.base, main_#t~ret8#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~length~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~c~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {591#true} is VALID [2022-02-20 23:40:39,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {591#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {591#true} is VALID [2022-02-20 23:40:39,378 INFO L290 TraceCheckUtils]: 3: Hoare triple {591#true} assume !(main_~n~0#1 < 1); {593#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:40:39,378 INFO L290 TraceCheckUtils]: 4: Hoare triple {593#(<= 1 |ULTIMATE.start_main_~n~0#1|)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;assume { :begin_inline_cmemset } true;cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset, cmemset_#in~c#1, cmemset_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemset_#res#1.base, cmemset_#res#1.offset;havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, cmemset_#t~pre2#1, cmemset_~d~0#1.base, cmemset_~d~0#1.offset, cmemset_~dst#1.base, cmemset_~dst#1.offset, cmemset_~c#1, cmemset_~n#1;cmemset_~dst#1.base, cmemset_~dst#1.offset := cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset;cmemset_~c#1 := cmemset_#in~c#1;cmemset_~n#1 := cmemset_#in~n#1; {616#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (<= |ULTIMATE.start_cmemset_~dst#1.offset| 0))} is VALID [2022-02-20 23:40:39,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {616#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (<= |ULTIMATE.start_cmemset_~dst#1.offset| 0))} assume 0 != cmemset_~n#1 % 4294967296;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_~dst#1.base, cmemset_~dst#1.offset; {620#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| 0))} is VALID [2022-02-20 23:40:39,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {620#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| 0))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {624#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= |ULTIMATE.start_cmemset_#t~post3#1.offset| 0))} is VALID [2022-02-20 23:40:39,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {624#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= |ULTIMATE.start_cmemset_#t~post3#1.offset| 0))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {628#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| 1))} is VALID [2022-02-20 23:40:39,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {628#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| 1))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {628#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| 1))} is VALID [2022-02-20 23:40:39,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {628#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| 1))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {635#(and (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= 0 |ULTIMATE.start_cmemset_#t~pre2#1|) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (<= (+ |ULTIMATE.start_cmemset_#t~pre2#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} is VALID [2022-02-20 23:40:39,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {635#(and (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= 0 |ULTIMATE.start_cmemset_#t~pre2#1|) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (<= (+ |ULTIMATE.start_cmemset_#t~pre2#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {639#(and (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (< 0 (+ (div (+ (- 2) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) 4294967296) 1)))} is VALID [2022-02-20 23:40:39,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {639#(and (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (< 0 (+ (div (+ (- 2) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) 4294967296) 1)))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {643#(and (<= |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (<= 1 |ULTIMATE.start_cmemset_#t~post3#1.offset|) (< 0 (+ (div (+ (- 2) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) 4294967296) 1)))} is VALID [2022-02-20 23:40:39,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {643#(and (<= |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (<= 1 |ULTIMATE.start_cmemset_#t~post3#1.offset|) (< 0 (+ (div (+ (- 2) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) 4294967296) 1)))} assume !(1 + cmemset_#t~post3#1.offset <= #length[cmemset_#t~post3#1.base] && 0 <= cmemset_#t~post3#1.offset); {592#false} is VALID [2022-02-20 23:40:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:39,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:40:39,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {647#(and (<= 0 |ULTIMATE.start_cmemset_#t~post3#1.offset|) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)))} assume !(1 + cmemset_#t~post3#1.offset <= #length[cmemset_#t~post3#1.base] && 0 <= cmemset_#t~post3#1.offset); {592#false} is VALID [2022-02-20 23:40:39,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {651#(and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {647#(and (<= 0 |ULTIMATE.start_cmemset_#t~post3#1.offset|) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)))} is VALID [2022-02-20 23:40:39,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {655#(or (= 0 (mod |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296)) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {651#(and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:39,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {655#(or (= 0 (mod |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296)) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:39,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {659#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:39,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {666#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= 0 |ULTIMATE.start_cmemset_#t~post3#1.offset|)) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {659#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:39,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {670#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (< |ULTIMATE.start_cmemset_~d~0#1.offset| 0))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {666#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= 0 |ULTIMATE.start_cmemset_#t~post3#1.offset|)) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:39,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {674#(or (<= (+ |ULTIMATE.start_cmemset_~dst#1.offset| 2) (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (< |ULTIMATE.start_cmemset_~dst#1.offset| 0))} assume 0 != cmemset_~n#1 % 4294967296;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_~dst#1.base, cmemset_~dst#1.offset; {670#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (< |ULTIMATE.start_cmemset_~d~0#1.offset| 0))} is VALID [2022-02-20 23:40:39,918 INFO L290 TraceCheckUtils]: 4: Hoare triple {678#(or (= (mod (+ 4294967295 |ULTIMATE.start_main_~n~0#1|) 4294967296) 0) (<= 2 |ULTIMATE.start_main_~n~0#1|))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;assume { :begin_inline_cmemset } true;cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset, cmemset_#in~c#1, cmemset_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemset_#res#1.base, cmemset_#res#1.offset;havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, cmemset_#t~pre2#1, cmemset_~d~0#1.base, cmemset_~d~0#1.offset, cmemset_~dst#1.base, cmemset_~dst#1.offset, cmemset_~c#1, cmemset_~n#1;cmemset_~dst#1.base, cmemset_~dst#1.offset := cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset;cmemset_~c#1 := cmemset_#in~c#1;cmemset_~n#1 := cmemset_#in~n#1; {674#(or (<= (+ |ULTIMATE.start_cmemset_~dst#1.offset| 2) (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (< |ULTIMATE.start_cmemset_~dst#1.offset| 0))} is VALID [2022-02-20 23:40:39,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {591#true} assume !(main_~n~0#1 < 1); {678#(or (= (mod (+ 4294967295 |ULTIMATE.start_main_~n~0#1|) 4294967296) 0) (<= 2 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 23:40:39,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {591#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {591#true} is VALID [2022-02-20 23:40:39,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {591#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~ret8#1.base, main_#t~ret8#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~length~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~c~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {591#true} is VALID [2022-02-20 23:40:39,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {591#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {591#true} is VALID [2022-02-20 23:40:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:39,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624669303] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:40:39,919 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:40:39,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-02-20 23:40:39,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920483911] [2022-02-20 23:40:39,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:40:39,920 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 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) Word has length 13 [2022-02-20 23:40:39,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:39,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 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-20 23:40:39,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:39,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 23:40:39,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:39,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 23:40:39,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:40:39,967 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 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-20 23:40:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:40,449 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-20 23:40:40,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:40:40,449 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 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) Word has length 13 [2022-02-20 23:40:40,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 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-20 23:40:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2022-02-20 23:40:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 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-20 23:40:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2022-02-20 23:40:40,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 28 transitions. [2022-02-20 23:40:40,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:40,472 INFO L225 Difference]: With dead ends: 31 [2022-02-20 23:40:40,472 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 23:40:40,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2022-02-20 23:40:40,473 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:40,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 134 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 23:40:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-02-20 23:40:40,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:40,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:40,475 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:40,475 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:40,475 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-20 23:40:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-20 23:40:40,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:40,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:40,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2022-02-20 23:40:40,478 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2022-02-20 23:40:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:40,479 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-20 23:40:40,479 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-20 23:40:40,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:40,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:40,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:40,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-02-20 23:40:40,481 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 13 [2022-02-20 23:40:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:40,481 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-02-20 23:40:40,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 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-20 23:40:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 23:40:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:40:40,482 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:40,482 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:40,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:40,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 23:40:40,683 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:40:40,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:40,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1548436090, now seen corresponding path program 1 times [2022-02-20 23:40:40,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:40,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178980478] [2022-02-20 23:40:40,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:40,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:40,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {829#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {829#true} is VALID [2022-02-20 23:40:40,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {829#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~ret8#1.base, main_#t~ret8#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~length~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~c~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {831#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:40:40,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {831#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {831#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:40:40,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {831#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume main_~n~0#1 < 1;main_~n~0#1 := 1; {831#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:40:40,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {831#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;assume { :begin_inline_cmemset } true;cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset, cmemset_#in~c#1, cmemset_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemset_#res#1.base, cmemset_#res#1.offset;havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, cmemset_#t~pre2#1, cmemset_~d~0#1.base, cmemset_~d~0#1.offset, cmemset_~dst#1.base, cmemset_~dst#1.offset, cmemset_~c#1, cmemset_~n#1;cmemset_~dst#1.base, cmemset_~dst#1.offset := cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset;cmemset_~c#1 := cmemset_#in~c#1;cmemset_~n#1 := cmemset_#in~n#1; {832#(= (store |#valid| |ULTIMATE.start_main_#t~malloc7#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:40:40,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {832#(= (store |#valid| |ULTIMATE.start_main_#t~malloc7#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume 0 != cmemset_~n#1 % 4294967296;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_~dst#1.base, cmemset_~dst#1.offset; {832#(= (store |#valid| |ULTIMATE.start_main_#t~malloc7#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:40:40,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {832#(= (store |#valid| |ULTIMATE.start_main_#t~malloc7#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {832#(= (store |#valid| |ULTIMATE.start_main_#t~malloc7#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:40:40,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {832#(= (store |#valid| |ULTIMATE.start_main_#t~malloc7#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {832#(= (store |#valid| |ULTIMATE.start_main_#t~malloc7#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:40:40,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {832#(= (store |#valid| |ULTIMATE.start_main_#t~malloc7#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {832#(= (store |#valid| |ULTIMATE.start_main_#t~malloc7#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:40:40,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {832#(= (store |#valid| |ULTIMATE.start_main_#t~malloc7#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {832#(= (store |#valid| |ULTIMATE.start_main_#t~malloc7#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:40:40,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {832#(= (store |#valid| |ULTIMATE.start_main_#t~malloc7#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {832#(= (store |#valid| |ULTIMATE.start_main_#t~malloc7#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:40:40,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {832#(= (store |#valid| |ULTIMATE.start_main_#t~malloc7#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} cmemset_#res#1.base, cmemset_#res#1.offset := cmemset_~dst#1.base, cmemset_~dst#1.offset; {832#(= (store |#valid| |ULTIMATE.start_main_#t~malloc7#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:40:40,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {832#(= (store |#valid| |ULTIMATE.start_main_#t~malloc7#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} main_#t~ret8#1.base, main_#t~ret8#1.offset := cmemset_#res#1.base, cmemset_#res#1.offset;assume { :end_inline_cmemset } true;havoc main_#t~ret8#1.base, main_#t~ret8#1.offset;main_#res#1 := 0;call ULTIMATE.dealloc(main_#t~malloc7#1.base, main_#t~malloc7#1.offset);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {831#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:40:40,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {830#false} is VALID [2022-02-20 23:40:40,738 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-20 23:40:40,739 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:40,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178980478] [2022-02-20 23:40:40,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178980478] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:40,740 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:40,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:40:40,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090924082] [2022-02-20 23:40:40,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:40,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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) Word has length 14 [2022-02-20 23:40:40,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:40,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-20 23:40:40,750 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-20 23:40:40,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:40:40,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:40,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:40:40,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:40:40,751 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-20 23:40:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:40,773 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 23:40:40,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:40:40,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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) Word has length 14 [2022-02-20 23:40:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-20 23:40:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-20 23:40:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-20 23:40:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-20 23:40:40,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-02-20 23:40:40,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:40,785 INFO L225 Difference]: With dead ends: 29 [2022-02-20 23:40:40,786 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 23:40:40,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:40:40,786 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:40,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:40:40,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 23:40:40,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 23:40:40,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:40,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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-20 23:40:40,788 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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-20 23:40:40,788 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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-20 23:40:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:40,789 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-20 23:40:40,789 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:40:40,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:40,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:40,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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. [2022-02-20 23:40:40,790 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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. [2022-02-20 23:40:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:40,790 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-20 23:40:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:40:40,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:40,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:40,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:40,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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-20 23:40:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-02-20 23:40:40,791 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2022-02-20 23:40:40,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:40,792 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-02-20 23:40:40,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-20 23:40:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:40:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:40:40,792 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:40,792 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:40,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:40:40,793 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:40:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:40,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1854015663, now seen corresponding path program 2 times [2022-02-20 23:40:40,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:40,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446973712] [2022-02-20 23:40:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:40,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:41,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {921#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {921#true} is VALID [2022-02-20 23:40:41,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {921#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~ret8#1.base, main_#t~ret8#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~length~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~c~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {921#true} is VALID [2022-02-20 23:40:41,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {921#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {921#true} is VALID [2022-02-20 23:40:41,095 INFO L290 TraceCheckUtils]: 3: Hoare triple {921#true} assume !(main_~n~0#1 < 1); {921#true} is VALID [2022-02-20 23:40:41,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {921#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;assume { :begin_inline_cmemset } true;cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset, cmemset_#in~c#1, cmemset_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemset_#res#1.base, cmemset_#res#1.offset;havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, cmemset_#t~pre2#1, cmemset_~d~0#1.base, cmemset_~d~0#1.offset, cmemset_~dst#1.base, cmemset_~dst#1.offset, cmemset_~c#1, cmemset_~n#1;cmemset_~dst#1.base, cmemset_~dst#1.offset := cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset;cmemset_~c#1 := cmemset_#in~c#1;cmemset_~n#1 := cmemset_#in~n#1; {923#(and (<= (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|) |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (= |ULTIMATE.start_cmemset_~dst#1.offset| 0))} is VALID [2022-02-20 23:40:41,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {923#(and (<= (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|) |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (= |ULTIMATE.start_cmemset_~dst#1.offset| 0))} assume 0 != cmemset_~n#1 % 4294967296;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_~dst#1.base, cmemset_~dst#1.offset; {924#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= |ULTIMATE.start_cmemset_~d~0#1.offset| 0))} is VALID [2022-02-20 23:40:41,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {924#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= |ULTIMATE.start_cmemset_~d~0#1.offset| 0))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {925#(and (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (= |ULTIMATE.start_cmemset_#t~post3#1.offset| 0) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)))} is VALID [2022-02-20 23:40:41,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {925#(and (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (= |ULTIMATE.start_cmemset_#t~post3#1.offset| 0) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {926#(and (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:41,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {926#(and (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {926#(and (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:41,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {926#(and (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {927#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (or (<= |ULTIMATE.start_cmemset_#t~pre2#1| |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_#t~pre2#1| (* (div |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296) 4294967296))) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_#t~pre2#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:41,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {927#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (or (<= |ULTIMATE.start_cmemset_#t~pre2#1| |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_#t~pre2#1| (* (div |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296) 4294967296))) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_#t~pre2#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {928#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (+ (* 4294967296 (div (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (* (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)) 4294967296)) 1) |ULTIMATE.start_cmemset_~n#1|) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:41,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {928#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (+ (* 4294967296 (div (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (* (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)) 4294967296)) 1) |ULTIMATE.start_cmemset_~n#1|) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {929#(and (<= (+ (* (div (+ (* (- 1) |ULTIMATE.start_cmemset_#t~post3#1.offset|) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) 4294967296) 4294967296) 1) |ULTIMATE.start_cmemset_~n#1|) (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)))} is VALID [2022-02-20 23:40:41,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {929#(and (<= (+ (* (div (+ (* (- 1) |ULTIMATE.start_cmemset_#t~post3#1.offset|) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) 4294967296) 4294967296) 1) |ULTIMATE.start_cmemset_~n#1|) (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {930#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)))} is VALID [2022-02-20 23:40:41,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {930#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {930#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)))} is VALID [2022-02-20 23:40:41,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {930#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {931#(and (or (<= |ULTIMATE.start_cmemset_#t~pre2#1| (* (div |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296) 4294967296)) (<= (+ |ULTIMATE.start_cmemset_#t~pre2#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (< 0 (+ (div |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296) 1)) (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:41,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {931#(and (or (<= |ULTIMATE.start_cmemset_#t~pre2#1| (* (div |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296) 4294967296)) (<= (+ |ULTIMATE.start_cmemset_#t~pre2#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (< 0 (+ (div |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296) 1)) (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {932#(and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:41,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {932#(and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {933#(and (<= 2 |ULTIMATE.start_cmemset_#t~post3#1.offset|) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)))} is VALID [2022-02-20 23:40:41,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {933#(and (<= 2 |ULTIMATE.start_cmemset_#t~post3#1.offset|) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)))} assume !(1 + cmemset_#t~post3#1.offset <= #length[cmemset_#t~post3#1.base] && 0 <= cmemset_#t~post3#1.offset); {922#false} is VALID [2022-02-20 23:40:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:41,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:41,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446973712] [2022-02-20 23:40:41,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446973712] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:40:41,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160556955] [2022-02-20 23:40:41,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:40:41,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:40:41,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:40:41,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:40:41,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:40:41,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:40:41,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:40:41,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 53 conjunts are in the unsatisfiable core [2022-02-20 23:40:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:41,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:41,282 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:40:41,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {921#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {921#true} is VALID [2022-02-20 23:40:41,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {921#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~ret8#1.base, main_#t~ret8#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~length~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~c~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {921#true} is VALID [2022-02-20 23:40:41,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {921#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {921#true} is VALID [2022-02-20 23:40:41,897 INFO L290 TraceCheckUtils]: 3: Hoare triple {921#true} assume !(main_~n~0#1 < 1); {921#true} is VALID [2022-02-20 23:40:41,908 INFO L290 TraceCheckUtils]: 4: Hoare triple {921#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;assume { :begin_inline_cmemset } true;cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset, cmemset_#in~c#1, cmemset_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemset_#res#1.base, cmemset_#res#1.offset;havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, cmemset_#t~pre2#1, cmemset_~d~0#1.base, cmemset_~d~0#1.offset, cmemset_~dst#1.base, cmemset_~dst#1.offset, cmemset_~c#1, cmemset_~n#1;cmemset_~dst#1.base, cmemset_~dst#1.offset := cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset;cmemset_~c#1 := cmemset_#in~c#1;cmemset_~n#1 := cmemset_#in~n#1; {923#(and (<= (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|) |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (= |ULTIMATE.start_cmemset_~dst#1.offset| 0))} is VALID [2022-02-20 23:40:41,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {923#(and (<= (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|) |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (= |ULTIMATE.start_cmemset_~dst#1.offset| 0))} assume 0 != cmemset_~n#1 % 4294967296;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_~dst#1.base, cmemset_~dst#1.offset; {924#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= |ULTIMATE.start_cmemset_~d~0#1.offset| 0))} is VALID [2022-02-20 23:40:41,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {924#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= |ULTIMATE.start_cmemset_~d~0#1.offset| 0))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {955#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= |ULTIMATE.start_cmemset_#t~post3#1.offset| 0))} is VALID [2022-02-20 23:40:41,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {955#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= |ULTIMATE.start_cmemset_#t~post3#1.offset| 0))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {959#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} is VALID [2022-02-20 23:40:41,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {959#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {959#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} is VALID [2022-02-20 23:40:41,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {959#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {966#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:41,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {966#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {966#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:41,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {966#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {973#(and (= |ULTIMATE.start_cmemset_#t~post3#1.base| |ULTIMATE.start_cmemset_~d~0#1.base|) (= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (= |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)))} is VALID [2022-02-20 23:40:41,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {973#(and (= |ULTIMATE.start_cmemset_#t~post3#1.base| |ULTIMATE.start_cmemset_~d~0#1.base|) (= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (= |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {977#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:41,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {977#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {977#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:41,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {977#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {984#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_#t~pre2#1| 2)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= (+ |ULTIMATE.start_cmemset_#t~pre2#1| 2) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} is VALID [2022-02-20 23:40:41,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {984#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_#t~pre2#1| 2)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= (+ |ULTIMATE.start_cmemset_#t~pre2#1| 2) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {988#(and (< (div (+ (* (- 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) 4294967297) (- 4294967296)) (+ (div (+ (- 3) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) 4294967296) 1)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:41,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {988#(and (< (div (+ (* (- 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) 4294967297) (- 4294967296)) (+ (div (+ (- 3) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) 4294967296) 1)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {992#(and (<= |ULTIMATE.start_cmemset_#t~post3#1.offset| (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) (< (div (+ 4294967297 (* (- 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|))) (- 4294967296)) (+ (div (+ (- 3) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) 4294967296) 1)) (= (+ (- 1) |ULTIMATE.start_cmemset_#t~post3#1.offset|) 1))} is VALID [2022-02-20 23:40:41,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {992#(and (<= |ULTIMATE.start_cmemset_#t~post3#1.offset| (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) (< (div (+ 4294967297 (* (- 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|))) (- 4294967296)) (+ (div (+ (- 3) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) 4294967296) 1)) (= (+ (- 1) |ULTIMATE.start_cmemset_#t~post3#1.offset|) 1))} assume !(1 + cmemset_#t~post3#1.offset <= #length[cmemset_#t~post3#1.base] && 0 <= cmemset_#t~post3#1.offset); {922#false} is VALID [2022-02-20 23:40:41,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:41,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:40:42,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {996#(and (<= 0 |ULTIMATE.start_cmemset_#t~post3#1.offset|) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)))} assume !(1 + cmemset_#t~post3#1.offset <= #length[cmemset_#t~post3#1.base] && 0 <= cmemset_#t~post3#1.offset); {922#false} is VALID [2022-02-20 23:40:42,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {1000#(and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {996#(and (<= 0 |ULTIMATE.start_cmemset_#t~post3#1.offset|) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)))} is VALID [2022-02-20 23:40:42,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {1004#(or (= 0 (mod |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296)) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1000#(and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:42,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {1008#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1004#(or (= 0 (mod |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296)) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:42,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {1008#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1008#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:42,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {1015#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|))) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1008#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:42,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {1019#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1015#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|))) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:42,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {1019#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1019#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} is VALID [2022-02-20 23:40:42,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {1026#(or (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1019#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} is VALID [2022-02-20 23:40:42,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {1026#(or (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1026#(or (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} is VALID [2022-02-20 23:40:42,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {1033#(or (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= 0 |ULTIMATE.start_cmemset_#t~post3#1.offset|)) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1026#(or (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} is VALID [2022-02-20 23:40:42,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {1037#(or (not (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)) (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1033#(or (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= 0 |ULTIMATE.start_cmemset_#t~post3#1.offset|)) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} is VALID [2022-02-20 23:40:42,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {1041#(or (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ |ULTIMATE.start_cmemset_~dst#1.offset| 3) (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (not (<= (+ |ULTIMATE.start_cmemset_~dst#1.offset| 2) (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|))) (not (<= 0 |ULTIMATE.start_cmemset_~dst#1.offset|)))} assume 0 != cmemset_~n#1 % 4294967296;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_~dst#1.base, cmemset_~dst#1.offset; {1037#(or (not (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)) (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} is VALID [2022-02-20 23:40:42,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {921#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;assume { :begin_inline_cmemset } true;cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset, cmemset_#in~c#1, cmemset_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemset_#res#1.base, cmemset_#res#1.offset;havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, cmemset_#t~pre2#1, cmemset_~d~0#1.base, cmemset_~d~0#1.offset, cmemset_~dst#1.base, cmemset_~dst#1.offset, cmemset_~c#1, cmemset_~n#1;cmemset_~dst#1.base, cmemset_~dst#1.offset := cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset;cmemset_~c#1 := cmemset_#in~c#1;cmemset_~n#1 := cmemset_#in~n#1; {1041#(or (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ |ULTIMATE.start_cmemset_~dst#1.offset| 3) (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (not (<= (+ |ULTIMATE.start_cmemset_~dst#1.offset| 2) (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|))) (not (<= 0 |ULTIMATE.start_cmemset_~dst#1.offset|)))} is VALID [2022-02-20 23:40:42,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {921#true} assume !(main_~n~0#1 < 1); {921#true} is VALID [2022-02-20 23:40:42,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {921#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {921#true} is VALID [2022-02-20 23:40:42,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {921#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~ret8#1.base, main_#t~ret8#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~length~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~c~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {921#true} is VALID [2022-02-20 23:40:42,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {921#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {921#true} is VALID [2022-02-20 23:40:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:42,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160556955] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:40:42,678 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:40:42,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2022-02-20 23:40:42,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716353524] [2022-02-20 23:40:42,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:40:42,679 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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) Word has length 18 [2022-02-20 23:40:42,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:42,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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-20 23:40:42,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:42,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-20 23:40:42,719 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:42,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-20 23:40:42,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2022-02-20 23:40:42,720 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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-20 23:40:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:43,998 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-02-20 23:40:43,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 23:40:43,999 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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) Word has length 18 [2022-02-20 23:40:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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-20 23:40:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 38 transitions. [2022-02-20 23:40:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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-20 23:40:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 38 transitions. [2022-02-20 23:40:44,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 38 transitions. [2022-02-20 23:40:44,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:44,039 INFO L225 Difference]: With dead ends: 34 [2022-02-20 23:40:44,040 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 23:40:44,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=246, Invalid=1734, Unknown=0, NotChecked=0, Total=1980 [2022-02-20 23:40:44,040 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:44,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 127 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:40:44,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 23:40:44,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 23:40:44,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:44,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:44,042 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:44,043 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:44,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:44,043 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-02-20 23:40:44,043 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-20 23:40:44,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:44,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:44,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 23:40:44,044 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 23:40:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:44,044 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-02-20 23:40:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-20 23:40:44,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:44,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:44,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:44,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-02-20 23:40:44,045 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 18 [2022-02-20 23:40:44,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:44,046 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-02-20 23:40:44,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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-20 23:40:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-20 23:40:44,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:40:44,046 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:44,047 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:44,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:44,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-02-20 23:40:44,256 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:40:44,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:44,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1162598157, now seen corresponding path program 3 times [2022-02-20 23:40:44,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:40:44,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549363306] [2022-02-20 23:40:44,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:44,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:40:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:44,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {1220#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1220#true} is VALID [2022-02-20 23:40:44,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {1220#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~ret8#1.base, main_#t~ret8#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~length~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~c~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1220#true} is VALID [2022-02-20 23:40:44,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {1220#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {1220#true} is VALID [2022-02-20 23:40:44,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {1220#true} assume !(main_~n~0#1 < 1); {1220#true} is VALID [2022-02-20 23:40:44,630 INFO L290 TraceCheckUtils]: 4: Hoare triple {1220#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;assume { :begin_inline_cmemset } true;cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset, cmemset_#in~c#1, cmemset_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemset_#res#1.base, cmemset_#res#1.offset;havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, cmemset_#t~pre2#1, cmemset_~d~0#1.base, cmemset_~d~0#1.offset, cmemset_~dst#1.base, cmemset_~dst#1.offset, cmemset_~c#1, cmemset_~n#1;cmemset_~dst#1.base, cmemset_~dst#1.offset := cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset;cmemset_~c#1 := cmemset_#in~c#1;cmemset_~n#1 := cmemset_#in~n#1; {1222#(and (<= (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|) |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (= |ULTIMATE.start_cmemset_~dst#1.offset| 0))} is VALID [2022-02-20 23:40:44,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {1222#(and (<= (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|) |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (= |ULTIMATE.start_cmemset_~dst#1.offset| 0))} assume 0 != cmemset_~n#1 % 4294967296;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_~dst#1.base, cmemset_~dst#1.offset; {1223#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= |ULTIMATE.start_cmemset_~d~0#1.offset| 0))} is VALID [2022-02-20 23:40:44,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {1223#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= |ULTIMATE.start_cmemset_~d~0#1.offset| 0))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1224#(and (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (= |ULTIMATE.start_cmemset_#t~post3#1.offset| 0) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)))} is VALID [2022-02-20 23:40:44,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {1224#(and (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (= |ULTIMATE.start_cmemset_#t~post3#1.offset| 0) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1225#(and (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:44,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {1225#(and (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1225#(and (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:44,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {1225#(and (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1226#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:44,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {1226#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1226#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:44,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {1226#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 1 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1227#(and (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:44,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {1227#(and (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1227#(and (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:44,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {1227#(and (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1227#(and (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:44,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {1227#(and (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1228#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {1228#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1228#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {1228#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1229#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {1229#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1229#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {1229#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1229#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {1229#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1230#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {1230#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1230#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {1230#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1231#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 4 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {1231#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 4 |ULTIMATE.start_cmemset_~d~0#1.offset|))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1231#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 4 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {1231#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 4 |ULTIMATE.start_cmemset_~d~0#1.offset|))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1231#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 4 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {1231#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 4 |ULTIMATE.start_cmemset_~d~0#1.offset|))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1232#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 4 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {1232#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 4 |ULTIMATE.start_cmemset_~d~0#1.offset|))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1232#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 4 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {1232#(and (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= 4 |ULTIMATE.start_cmemset_~d~0#1.offset|))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1233#(and (<= (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|) (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| |ULTIMATE.start_cmemset_~n#1|)) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= 5 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {1233#(and (<= (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|) (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| |ULTIMATE.start_cmemset_~n#1|)) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= 5 |ULTIMATE.start_cmemset_~d~0#1.offset|))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1234#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= 5 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {1234#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= 5 |ULTIMATE.start_cmemset_~d~0#1.offset|))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1234#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= 5 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {1234#(and (<= 1 |ULTIMATE.start_cmemset_~n#1|) (<= (+ |ULTIMATE.start_cmemset_~n#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) 1)) (<= 5 |ULTIMATE.start_cmemset_~d~0#1.offset|))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1235#(and (or (<= |ULTIMATE.start_cmemset_#t~pre2#1| (* (div |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296) 4294967296)) (<= (+ |ULTIMATE.start_cmemset_#t~pre2#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (<= 0 |ULTIMATE.start_cmemset_#t~pre2#1|) (<= 5 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,666 INFO L290 TraceCheckUtils]: 30: Hoare triple {1235#(and (or (<= |ULTIMATE.start_cmemset_#t~pre2#1| (* (div |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296) 4294967296)) (<= (+ |ULTIMATE.start_cmemset_#t~pre2#1| |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (<= 0 |ULTIMATE.start_cmemset_#t~pre2#1|) (<= 5 |ULTIMATE.start_cmemset_~d~0#1.offset|))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1236#(and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 5 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:44,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {1236#(and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 5 |ULTIMATE.start_cmemset_~d~0#1.offset|))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1237#(and (<= 5 |ULTIMATE.start_cmemset_#t~post3#1.offset|) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)))} is VALID [2022-02-20 23:40:44,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {1237#(and (<= 5 |ULTIMATE.start_cmemset_#t~post3#1.offset|) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)))} assume !(1 + cmemset_#t~post3#1.offset <= #length[cmemset_#t~post3#1.base] && 0 <= cmemset_#t~post3#1.offset); {1221#false} is VALID [2022-02-20 23:40:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 27 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:44,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:40:44,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549363306] [2022-02-20 23:40:44,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549363306] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:40:44,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965691554] [2022-02-20 23:40:44,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:40:44,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:40:44,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:40:44,669 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-20 23:40:44,669 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-20 23:40:44,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-20 23:40:44,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:40:44,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 83 conjunts are in the unsatisfiable core [2022-02-20 23:40:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:44,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:44,872 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:40:45,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {1220#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1220#true} is VALID [2022-02-20 23:40:45,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {1220#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~ret8#1.base, main_#t~ret8#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~length~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~c~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1220#true} is VALID [2022-02-20 23:40:45,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {1220#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {1220#true} is VALID [2022-02-20 23:40:45,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {1220#true} assume !(main_~n~0#1 < 1); {1220#true} is VALID [2022-02-20 23:40:45,788 INFO L290 TraceCheckUtils]: 4: Hoare triple {1220#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;assume { :begin_inline_cmemset } true;cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset, cmemset_#in~c#1, cmemset_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemset_#res#1.base, cmemset_#res#1.offset;havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, cmemset_#t~pre2#1, cmemset_~d~0#1.base, cmemset_~d~0#1.offset, cmemset_~dst#1.base, cmemset_~dst#1.offset, cmemset_~c#1, cmemset_~n#1;cmemset_~dst#1.base, cmemset_~dst#1.offset := cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset;cmemset_~c#1 := cmemset_#in~c#1;cmemset_~n#1 := cmemset_#in~n#1; {1222#(and (<= (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|) |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (= |ULTIMATE.start_cmemset_~dst#1.offset| 0))} is VALID [2022-02-20 23:40:45,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {1222#(and (<= (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|) |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)) (= |ULTIMATE.start_cmemset_~dst#1.offset| 0))} assume 0 != cmemset_~n#1 % 4294967296;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_~dst#1.base, cmemset_~dst#1.offset; {1223#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= |ULTIMATE.start_cmemset_~d~0#1.offset| 0))} is VALID [2022-02-20 23:40:45,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {1223#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= |ULTIMATE.start_cmemset_~d~0#1.offset| 0))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1259#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} is VALID [2022-02-20 23:40:45,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {1259#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1259#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} is VALID [2022-02-20 23:40:45,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {1259#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1259#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} is VALID [2022-02-20 23:40:45,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {1259#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) |ULTIMATE.start_cmemset_~n#1|) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)) (<= |ULTIMATE.start_cmemset_~n#1| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1269#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:45,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {1269#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1269#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:45,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {1269#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 0 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1276#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:45,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {1276#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1276#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:45,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {1276#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1276#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:45,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {1276#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 1)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1286#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 2 |ULTIMATE.start_cmemset_~n#1|)) (<= (+ 2 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:45,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {1286#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 2 |ULTIMATE.start_cmemset_~n#1|)) (<= (+ 2 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1286#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 2 |ULTIMATE.start_cmemset_~n#1|)) (<= (+ 2 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:45,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {1286#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 2 |ULTIMATE.start_cmemset_~n#1|)) (<= (+ 2 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 1 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1293#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 2 |ULTIMATE.start_cmemset_~n#1|)) (<= (+ 2 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (+ (- 2) |ULTIMATE.start_cmemset_~d~0#1.offset|) 1))} is VALID [2022-02-20 23:40:45,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {1293#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 2 |ULTIMATE.start_cmemset_~n#1|)) (<= (+ 2 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (+ (- 2) |ULTIMATE.start_cmemset_~d~0#1.offset|) 1))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1293#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 2 |ULTIMATE.start_cmemset_~n#1|)) (<= (+ 2 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (+ (- 2) |ULTIMATE.start_cmemset_~d~0#1.offset|) 1))} is VALID [2022-02-20 23:40:45,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {1293#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 2 |ULTIMATE.start_cmemset_~n#1|)) (<= (+ 2 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (+ (- 2) |ULTIMATE.start_cmemset_~d~0#1.offset|) 1))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1293#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 2 |ULTIMATE.start_cmemset_~n#1|)) (<= (+ 2 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (+ (- 2) |ULTIMATE.start_cmemset_~d~0#1.offset|) 1))} is VALID [2022-02-20 23:40:45,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {1293#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 2 |ULTIMATE.start_cmemset_~n#1|)) (<= (+ 2 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (+ (- 2) |ULTIMATE.start_cmemset_~d~0#1.offset|) 1))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1303#(and (<= (+ 3 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 3 |ULTIMATE.start_cmemset_~n#1|)) (= (+ (- 2) |ULTIMATE.start_cmemset_~d~0#1.offset|) 1))} is VALID [2022-02-20 23:40:45,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {1303#(and (<= (+ 3 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 3 |ULTIMATE.start_cmemset_~n#1|)) (= (+ (- 2) |ULTIMATE.start_cmemset_~d~0#1.offset|) 1))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1303#(and (<= (+ 3 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 3 |ULTIMATE.start_cmemset_~n#1|)) (= (+ (- 2) |ULTIMATE.start_cmemset_~d~0#1.offset|) 1))} is VALID [2022-02-20 23:40:45,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {1303#(and (<= (+ 3 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 3 |ULTIMATE.start_cmemset_~n#1|)) (= (+ (- 2) |ULTIMATE.start_cmemset_~d~0#1.offset|) 1))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1310#(and (<= (+ 3 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 3 |ULTIMATE.start_cmemset_~n#1|)) (= 3 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:45,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {1310#(and (<= (+ 3 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 3 |ULTIMATE.start_cmemset_~n#1|)) (= 3 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1310#(and (<= (+ 3 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 3 |ULTIMATE.start_cmemset_~n#1|)) (= 3 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:45,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {1310#(and (<= (+ 3 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 3 |ULTIMATE.start_cmemset_~n#1|)) (= 3 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1310#(and (<= (+ 3 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 3 |ULTIMATE.start_cmemset_~n#1|)) (= 3 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:45,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {1310#(and (<= (+ 3 |ULTIMATE.start_cmemset_~n#1|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ 3 |ULTIMATE.start_cmemset_~n#1|)) (= 3 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1320#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 4)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 4) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 3 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:45,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {1320#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 4)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 4) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 3 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1320#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 4)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 4) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 3 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:45,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {1320#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 4)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 4) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 3 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1327#(and (= |ULTIMATE.start_cmemset_#t~post3#1.base| |ULTIMATE.start_cmemset_~d~0#1.base|) (= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) |ULTIMATE.start_cmemset_~d~0#1.offset|) (= 3 (+ (- 1) |ULTIMATE.start_cmemset_#t~post3#1.offset|)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 4) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 4)))} is VALID [2022-02-20 23:40:45,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {1327#(and (= |ULTIMATE.start_cmemset_#t~post3#1.base| |ULTIMATE.start_cmemset_~d~0#1.base|) (= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) |ULTIMATE.start_cmemset_~d~0#1.offset|) (= 3 (+ (- 1) |ULTIMATE.start_cmemset_#t~post3#1.offset|)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 4) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 4)))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1331#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 4)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 4) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 4 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:45,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {1331#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 4)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 4) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 4 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1331#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 4)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 4) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 4 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:45,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {1331#(and (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_~n#1| 4)) (<= (+ |ULTIMATE.start_cmemset_~n#1| 4) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 4 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1338#(and (<= |ULTIMATE.start_cmemset_~d~0#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (+ |ULTIMATE.start_cmemset_#t~pre2#1| 5) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_#t~pre2#1| 5)) (= 4 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:45,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {1338#(and (<= |ULTIMATE.start_cmemset_~d~0#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (+ |ULTIMATE.start_cmemset_#t~pre2#1| 5) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (+ |ULTIMATE.start_cmemset_#t~pre2#1| 5)) (= 4 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1342#(and (< (div (+ (* (- 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) 4294967300) (- 4294967296)) (+ (div (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (- 6)) 4294967296) 1)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 4 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:45,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {1342#(and (< (div (+ (* (- 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) 4294967300) (- 4294967296)) (+ (div (+ (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|) (- 6)) 4294967296) 1)) (<= |ULTIMATE.start_cmemset_~d~0#1.offset| (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= 4 (+ (- 1) |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1346#(and (< (div (+ (* (- 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) 4294967300) (- 4294967296)) (+ (div (+ (- 6) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) 4294967296) 1)) (<= 5 (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) (= |ULTIMATE.start_cmemset_#t~post3#1.offset| 5))} is VALID [2022-02-20 23:40:45,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {1346#(and (< (div (+ (* (- 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) 4294967300) (- 4294967296)) (+ (div (+ (- 6) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) 4294967296) 1)) (<= 5 (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)) (= |ULTIMATE.start_cmemset_#t~post3#1.offset| 5))} assume !(1 + cmemset_#t~post3#1.offset <= #length[cmemset_#t~post3#1.base] && 0 <= cmemset_#t~post3#1.offset); {1221#false} is VALID [2022-02-20 23:40:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:45,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:40:46,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {1350#(and (<= 0 |ULTIMATE.start_cmemset_#t~post3#1.offset|) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)))} assume !(1 + cmemset_#t~post3#1.offset <= #length[cmemset_#t~post3#1.base] && 0 <= cmemset_#t~post3#1.offset); {1221#false} is VALID [2022-02-20 23:40:46,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {1354#(and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1350#(and (<= 0 |ULTIMATE.start_cmemset_#t~post3#1.offset|) (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|)))} is VALID [2022-02-20 23:40:46,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {1358#(or (= 0 (mod |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296)) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1354#(and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|))} is VALID [2022-02-20 23:40:46,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {1362#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1358#(or (= 0 (mod |ULTIMATE.start_cmemset_#t~pre2#1| 4294967296)) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:46,961 INFO L290 TraceCheckUtils]: 28: Hoare triple {1362#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1362#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:46,961 INFO L290 TraceCheckUtils]: 27: Hoare triple {1369#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|))) (not (<= 0 |ULTIMATE.start_cmemset_#t~post3#1.offset|)) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1362#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:46,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {1373#(or (not (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)) (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1369#(or (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= (+ |ULTIMATE.start_cmemset_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_#t~post3#1.base|))) (not (<= 0 |ULTIMATE.start_cmemset_#t~post3#1.offset|)) (and (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)))} is VALID [2022-02-20 23:40:46,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {1373#(or (not (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)) (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1373#(or (not (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)) (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} is VALID [2022-02-20 23:40:46,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {1380#(or (not (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)) (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1373#(or (not (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)) (= (mod (+ 4294967295 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} is VALID [2022-02-20 23:40:46,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#(or (not (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)) (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1380#(or (not (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)) (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} is VALID [2022-02-20 23:40:46,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#(or (not (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)) (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1380#(or (not (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)) (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} is VALID [2022-02-20 23:40:46,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {1390#(or (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1))) (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1380#(or (not (<= 0 |ULTIMATE.start_cmemset_~d~0#1.offset|)) (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (not (<= (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} is VALID [2022-02-20 23:40:46,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {1390#(or (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1))) (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1390#(or (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1))) (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} is VALID [2022-02-20 23:40:46,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {1397#(or (not (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1))) (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (mod (+ |ULTIMATE.start_cmemset_~n#1| 4294967293) 4294967296) 0))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1390#(or (= (mod (+ 4294967294 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1))) (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} is VALID [2022-02-20 23:40:46,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {1397#(or (not (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1))) (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (mod (+ |ULTIMATE.start_cmemset_~n#1| 4294967293) 4294967296) 0))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1397#(or (not (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1))) (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (mod (+ |ULTIMATE.start_cmemset_~n#1| 4294967293) 4294967296) 0))} is VALID [2022-02-20 23:40:46,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {1397#(or (not (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1))) (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (mod (+ |ULTIMATE.start_cmemset_~n#1| 4294967293) 4294967296) 0))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1397#(or (not (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1))) (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (mod (+ |ULTIMATE.start_cmemset_~n#1| 4294967293) 4294967296) 0))} is VALID [2022-02-20 23:40:46,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {1407#(or (not (<= 0 (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (= (mod (+ |ULTIMATE.start_cmemset_~n#1| 4294967293) 4294967296) 0) (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1397#(or (not (<= (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_cmemset_~d~0#1.offset| 1))) (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (mod (+ |ULTIMATE.start_cmemset_~n#1| 4294967293) 4294967296) 0))} is VALID [2022-02-20 23:40:46,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {1407#(or (not (<= 0 (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (= (mod (+ |ULTIMATE.start_cmemset_~n#1| 4294967293) 4294967296) 0) (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1407#(or (not (<= 0 (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (= (mod (+ |ULTIMATE.start_cmemset_~n#1| 4294967293) 4294967296) 0) (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} is VALID [2022-02-20 23:40:46,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {1414#(or (not (<= 0 (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (= (mod (+ 4294967292 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1407#(or (not (<= 0 (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (= (mod (+ |ULTIMATE.start_cmemset_~n#1| 4294967293) 4294967296) 0) (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} is VALID [2022-02-20 23:40:46,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {1414#(or (not (<= 0 (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (= (mod (+ 4294967292 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1414#(or (not (<= 0 (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (= (mod (+ 4294967292 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} is VALID [2022-02-20 23:40:46,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {1414#(or (not (<= 0 (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (= (mod (+ 4294967292 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1414#(or (not (<= 0 (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (= (mod (+ 4294967292 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} is VALID [2022-02-20 23:40:46,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {1424#(or (<= (+ 5 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (mod (+ 4294967292 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= 0 (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1414#(or (not (<= 0 (+ 2 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))) (= (mod (+ 4294967292 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)))} is VALID [2022-02-20 23:40:46,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {1424#(or (<= (+ 5 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (mod (+ 4294967292 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= 0 (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} assume !!(0 != cmemset_#t~pre2#1 % 4294967296);havoc cmemset_#t~pre2#1; {1424#(or (<= (+ 5 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (mod (+ 4294967292 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= 0 (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} is VALID [2022-02-20 23:40:46,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {1431#(or (= (mod (+ 4294967291 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 5 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (not (<= 0 (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} cmemset_#t~pre2#1 := cmemset_~n#1 - 1;cmemset_~n#1 := cmemset_~n#1 - 1; {1424#(or (<= (+ 5 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (mod (+ 4294967292 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= 0 (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} is VALID [2022-02-20 23:40:46,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {1431#(or (= (mod (+ 4294967291 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 5 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (not (<= 0 (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset; {1431#(or (= (mod (+ 4294967291 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 5 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (not (<= 0 (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} is VALID [2022-02-20 23:40:46,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {1431#(or (= (mod (+ 4294967291 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 5 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (not (<= 0 (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} SUMMARY for call write~int(cmemset_~c#1, cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, 1); srcloc: L518 {1431#(or (= (mod (+ 4294967291 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 5 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (not (<= 0 (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} is VALID [2022-02-20 23:40:46,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {1441#(or (<= (+ 6 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (mod (+ 4294967291 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= 0 (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 5 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset := cmemset_~d~0#1.base, cmemset_~d~0#1.offset;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_#t~post3#1.base, 1 + cmemset_#t~post3#1.offset; {1431#(or (= (mod (+ 4294967291 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (<= (+ 5 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (not (<= 0 (+ 3 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} is VALID [2022-02-20 23:40:46,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {1445#(or (= (mod (+ 4294967291 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= (+ 5 |ULTIMATE.start_cmemset_~dst#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|))) (not (<= 0 (+ |ULTIMATE.start_cmemset_~dst#1.offset| 4))) (<= (+ |ULTIMATE.start_cmemset_~dst#1.offset| 6) (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)))} assume 0 != cmemset_~n#1 % 4294967296;cmemset_~d~0#1.base, cmemset_~d~0#1.offset := cmemset_~dst#1.base, cmemset_~dst#1.offset; {1441#(or (<= (+ 6 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|)) (= (mod (+ 4294967291 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= 0 (+ 4 |ULTIMATE.start_cmemset_~d~0#1.offset|))) (not (<= (+ 5 |ULTIMATE.start_cmemset_~d~0#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~d~0#1.base|))))} is VALID [2022-02-20 23:40:46,980 INFO L290 TraceCheckUtils]: 4: Hoare triple {1220#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;assume { :begin_inline_cmemset } true;cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset, cmemset_#in~c#1, cmemset_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~c~0#1, main_~n~0#1;havoc cmemset_#res#1.base, cmemset_#res#1.offset;havoc cmemset_#t~post3#1.base, cmemset_#t~post3#1.offset, cmemset_#t~pre2#1, cmemset_~d~0#1.base, cmemset_~d~0#1.offset, cmemset_~dst#1.base, cmemset_~dst#1.offset, cmemset_~c#1, cmemset_~n#1;cmemset_~dst#1.base, cmemset_~dst#1.offset := cmemset_#in~dst#1.base, cmemset_#in~dst#1.offset;cmemset_~c#1 := cmemset_#in~c#1;cmemset_~n#1 := cmemset_#in~n#1; {1445#(or (= (mod (+ 4294967291 |ULTIMATE.start_cmemset_~n#1|) 4294967296) 0) (not (<= (+ 5 |ULTIMATE.start_cmemset_~dst#1.offset|) (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|))) (not (<= 0 (+ |ULTIMATE.start_cmemset_~dst#1.offset| 4))) (<= (+ |ULTIMATE.start_cmemset_~dst#1.offset| 6) (select |#length| |ULTIMATE.start_cmemset_~dst#1.base|)))} is VALID [2022-02-20 23:40:46,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {1220#true} assume !(main_~n~0#1 < 1); {1220#true} is VALID [2022-02-20 23:40:46,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {1220#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {1220#true} is VALID [2022-02-20 23:40:46,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {1220#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~ret8#1.base, main_#t~ret8#1.offset, main_~length~0#1, main_~n~0#1, main_~c~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~length~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~c~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1220#true} is VALID [2022-02-20 23:40:46,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {1220#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1220#true} is VALID [2022-02-20 23:40:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:46,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965691554] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:40:46,981 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:40:46,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 45 [2022-02-20 23:40:46,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944435095] [2022-02-20 23:40:46,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:40:46,982 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 46 states have internal predecessors, (89), 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) Word has length 33 [2022-02-20 23:40:46,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:46,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 46 states have internal predecessors, (89), 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-20 23:40:47,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:47,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-02-20 23:40:47,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:40:47,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-02-20 23:40:47,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1823, Unknown=0, NotChecked=0, Total=2070 [2022-02-20 23:40:47,057 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 46 states have internal predecessors, (89), 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-20 23:40:49,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:49,082 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-02-20 23:40:49,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-20 23:40:49,083 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 46 states have internal predecessors, (89), 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) Word has length 33 [2022-02-20 23:40:49,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 46 states have internal predecessors, (89), 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-20 23:40:49,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-02-20 23:40:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 46 states have internal predecessors, (89), 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-20 23:40:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-02-20 23:40:49,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 42 transitions. [2022-02-20 23:40:49,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:49,142 INFO L225 Difference]: With dead ends: 39 [2022-02-20 23:40:49,142 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 23:40:49,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=615, Invalid=4497, Unknown=0, NotChecked=0, Total=5112 [2022-02-20 23:40:49,144 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:49,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 190 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:40:49,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 23:40:49,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 23:40:49,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:49,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-20 23:40:49,144 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-20 23:40:49,145 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-20 23:40:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:49,145 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:40:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:40:49,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:49,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:49,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 23:40:49,145 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 23:40:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:49,146 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:40:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:40:49,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:49,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:49,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:49,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-20 23:40:49,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 23:40:49,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2022-02-20 23:40:49,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:49,147 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 23:40:49,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 46 states have internal predecessors, (89), 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-20 23:40:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:40:49,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:49,149 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION (2 of 3 remaining) [2022-02-20 23:40:49,150 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION (1 of 3 remaining) [2022-02-20 23:40:49,150 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 3 remaining) [2022-02-20 23:40:49,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 23:40:49,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:40:49,370 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:49,371 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:40:49,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:40:49 BoogieIcfgContainer [2022-02-20 23:40:49,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:40:49,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:40:49,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:40:49,373 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:40:49,373 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:40:36" (3/4) ... [2022-02-20 23:40:49,375 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 23:40:49,380 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 23:40:49,381 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 23:40:49,381 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 23:40:49,381 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 23:40:49,408 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:40:49,408 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:40:49,409 INFO L158 Benchmark]: Toolchain (without parser) took 13458.81ms. Allocated memory was 90.2MB in the beginning and 201.3MB in the end (delta: 111.1MB). Free memory was 59.1MB in the beginning and 168.1MB in the end (delta: -109.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:40:49,409 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 90.2MB. Free memory was 47.3MB in the beginning and 47.2MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:40:49,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.99ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 58.9MB in the beginning and 85.3MB in the end (delta: -26.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:40:49,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.67ms. Allocated memory is still 115.3MB. Free memory was 85.3MB in the beginning and 83.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:40:49,410 INFO L158 Benchmark]: Boogie Preprocessor took 32.94ms. Allocated memory is still 115.3MB. Free memory was 83.5MB in the beginning and 82.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:40:49,410 INFO L158 Benchmark]: RCFGBuilder took 300.07ms. Allocated memory is still 115.3MB. Free memory was 82.2MB in the beginning and 70.3MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:40:49,411 INFO L158 Benchmark]: TraceAbstraction took 12658.13ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 69.9MB in the beginning and 170.7MB in the end (delta: -100.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:40:49,411 INFO L158 Benchmark]: Witness Printer took 35.36ms. Allocated memory is still 201.3MB. Free memory was 170.7MB in the beginning and 168.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:40:49,418 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.34ms. Allocated memory is still 90.2MB. Free memory was 47.3MB in the beginning and 47.2MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.99ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 58.9MB in the beginning and 85.3MB in the end (delta: -26.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.67ms. Allocated memory is still 115.3MB. Free memory was 85.3MB in the beginning and 83.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.94ms. Allocated memory is still 115.3MB. Free memory was 83.5MB in the beginning and 82.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 300.07ms. Allocated memory is still 115.3MB. Free memory was 82.2MB in the beginning and 70.3MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12658.13ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 69.9MB in the beginning and 170.7MB in the end (delta: -100.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 35.36ms. Allocated memory is still 201.3MB. Free memory was 170.7MB in the beginning and 168.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 220 mSDsluCounter, 709 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 588 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 916 IncrementalHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 121 mSDtfsCounter, 916 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=8, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 40 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 3360 SizeOfPredicates, 49 NumberOfNonLiveVariables, 374 ConjunctsInSsa, 172 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 29/215 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 23:40:49,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE