./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/simple-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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/list-properties/simple-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a8519f8a7c8757a31f412eb366ebcbc8dd5e899d9ff0dd6bfc4f50c36dfb89b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:37:18,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:37:18,111 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:37:18,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:37:18,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:37:18,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:37:18,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:37:18,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:37:18,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:37:18,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:37:18,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:37:18,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:37:18,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:37:18,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:37:18,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:37:18,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:37:18,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:37:18,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:37:18,170 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:37:18,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:37:18,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:37:18,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:37:18,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:37:18,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:37:18,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:37:18,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:37:18,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:37:18,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:37:18,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:37:18,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:37:18,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:37:18,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:37:18,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:37:18,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:37:18,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:37:18,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:37:18,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:37:18,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:37:18,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:37:18,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:37:18,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:37:18,193 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-02-20 23:37:18,216 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:37:18,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:37:18,217 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:37:18,217 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:37:18,218 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:37:18,218 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:37:18,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:37:18,218 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:37:18,219 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:37:18,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:37:18,219 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:37:18,220 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:37:18,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:37:18,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:37:18,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:37:18,220 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:37:18,220 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:37:18,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:37:18,221 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:37:18,221 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:37:18,221 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:37:18,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:37:18,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:37:18,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:37:18,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:37:18,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:37:18,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:37:18,223 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:37:18,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:37:18,223 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-memcleanup) ) 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 -> 7a8519f8a7c8757a31f412eb366ebcbc8dd5e899d9ff0dd6bfc4f50c36dfb89b [2022-02-20 23:37:18,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:37:18,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:37:18,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:37:18,432 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:37:18,433 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:37:18,433 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple-1.i [2022-02-20 23:37:18,477 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3b7e13b/c59b6643a9b24d53a1ffe946ff13fb33/FLAG4955367cd [2022-02-20 23:37:18,874 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:37:18,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-1.i [2022-02-20 23:37:18,892 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3b7e13b/c59b6643a9b24d53a1ffe946ff13fb33/FLAG4955367cd [2022-02-20 23:37:18,905 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3b7e13b/c59b6643a9b24d53a1ffe946ff13fb33 [2022-02-20 23:37:18,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:37:18,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:37:18,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:37:18,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:37:18,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:37:18,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:37:18" (1/1) ... [2022-02-20 23:37:18,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4931a0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:18, skipping insertion in model container [2022-02-20 23:37:18,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:37:18" (1/1) ... [2022-02-20 23:37:18,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:37:18,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:37:19,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-1.i[23237,23250] [2022-02-20 23:37:19,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:37:19,194 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:37:19,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-1.i[23237,23250] [2022-02-20 23:37:19,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:37:19,253 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:37:19,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:19 WrapperNode [2022-02-20 23:37:19,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:37:19,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:37:19,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:37:19,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:37:19,261 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:37:19" (1/1) ... [2022-02-20 23:37:19,270 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:37:19" (1/1) ... [2022-02-20 23:37:19,284 INFO L137 Inliner]: procedures = 124, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-02-20 23:37:19,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:37:19,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:37:19,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:37:19,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:37:19,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:19" (1/1) ... [2022-02-20 23:37:19,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:19" (1/1) ... [2022-02-20 23:37:19,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:19" (1/1) ... [2022-02-20 23:37:19,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:19" (1/1) ... [2022-02-20 23:37:19,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:19" (1/1) ... [2022-02-20 23:37:19,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:19" (1/1) ... [2022-02-20 23:37:19,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:19" (1/1) ... [2022-02-20 23:37:19,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:37:19,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:37:19,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:37:19,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:37:19,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:19" (1/1) ... [2022-02-20 23:37:19,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:37:19,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:37:19,342 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:37:19,346 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:37:19,365 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-02-20 23:37:19,365 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-02-20 23:37:19,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:37:19,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:37:19,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:37:19,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:37:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:37:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:37:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:37:19,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:37:19,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:37:19,427 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:37:19,428 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:37:19,471 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-02-20 23:37:19,720 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:37:19,725 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:37:19,725 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 23:37:19,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:37:19 BoogieIcfgContainer [2022-02-20 23:37:19,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:37:19,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:37:19,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:37:19,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:37:19,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:37:18" (1/3) ... [2022-02-20 23:37:19,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df3f6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:37:19, skipping insertion in model container [2022-02-20 23:37:19,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:19" (2/3) ... [2022-02-20 23:37:19,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df3f6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:37:19, skipping insertion in model container [2022-02-20 23:37:19,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:37:19" (3/3) ... [2022-02-20 23:37:19,750 INFO L111 eAbstractionObserver]: Analyzing ICFG simple-1.i [2022-02-20 23:37:19,754 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:37:19,754 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-02-20 23:37:19,801 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:37:19,807 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:37:19,807 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-02-20 23:37:19,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 46 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:37:19,824 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:19,824 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:37:19,825 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:37:19,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:19,828 INFO L85 PathProgramCache]: Analyzing trace with hash 33468268, now seen corresponding path program 1 times [2022-02-20 23:37:19,835 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:19,835 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124503681] [2022-02-20 23:37:19,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:19,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:19,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {51#true} is VALID [2022-02-20 23:37:19,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet4#1, main_#t~mem7#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {53#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:37:19,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {53#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {53#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:37:19,958 INFO L290 TraceCheckUtils]: 3: Hoare triple {53#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {53#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:37:19,959 INFO L290 TraceCheckUtils]: 4: Hoare triple {53#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} assume !(1 == #valid[main_~a~0#1.base]); {52#false} is VALID [2022-02-20 23:37:19,960 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:37:19,960 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:19,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124503681] [2022-02-20 23:37:19,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124503681] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:19,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:19,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:37:19,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144916559] [2022-02-20 23:37:19,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:19,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:37:19,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:19,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:37:19,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:19,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:37:19,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:20,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:37:20,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:20,010 INFO L87 Difference]: Start difference. First operand has 48 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 46 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:37:20,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:20,117 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-02-20 23:37:20,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:37:20,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:37:20,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:37:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 23:37:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:37:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 23:37:20,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-02-20 23:37:20,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:20,192 INFO L225 Difference]: With dead ends: 47 [2022-02-20 23:37:20,192 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 23:37:20,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:20,195 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:20,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 29 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:37:20,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 23:37:20,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-02-20 23:37:20,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:20,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.75) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 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:37:20,215 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.75) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 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:37:20,215 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.75) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 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:37:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:20,218 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-02-20 23:37:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-02-20 23:37:20,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:20,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:20,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 24 states have (on average 1.75) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 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 41 states. [2022-02-20 23:37:20,219 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.75) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 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 41 states. [2022-02-20 23:37:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:20,221 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-02-20 23:37:20,221 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-02-20 23:37:20,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:20,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:20,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:20,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.75) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 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:37:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2022-02-20 23:37:20,230 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 5 [2022-02-20 23:37:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:20,231 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2022-02-20 23:37:20,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:37:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-02-20 23:37:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:37:20,232 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:20,232 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:37:20,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:37:20,233 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:37:20,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:20,234 INFO L85 PathProgramCache]: Analyzing trace with hash 33468269, now seen corresponding path program 1 times [2022-02-20 23:37:20,234 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:20,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225762032] [2022-02-20 23:37:20,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:20,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:20,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {226#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {226#true} is VALID [2022-02-20 23:37:20,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet4#1, main_#t~mem7#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {228#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:37:20,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (- 8)) 0))} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {228#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:37:20,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {228#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (- 8)) 0))} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {228#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:37:20,327 INFO L290 TraceCheckUtils]: 4: Hoare triple {228#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (- 8)) 0))} assume !(4 + main_~a~0#1.offset <= #length[main_~a~0#1.base] && 0 <= main_~a~0#1.offset); {227#false} is VALID [2022-02-20 23:37:20,327 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:37:20,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:20,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225762032] [2022-02-20 23:37:20,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225762032] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:20,328 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:20,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:37:20,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916301310] [2022-02-20 23:37:20,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:20,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:37:20,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:20,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:37:20,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:20,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:37:20,344 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:20,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:37:20,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:20,345 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:37:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:20,402 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-02-20 23:37:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:37:20,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:37:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:37:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-02-20 23:37:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:37:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-02-20 23:37:20,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-02-20 23:37:20,445 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:37:20,446 INFO L225 Difference]: With dead ends: 40 [2022-02-20 23:37:20,446 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 23:37:20,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:20,447 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:20,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 22 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:37:20,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 23:37:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-20 23:37:20,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:20,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:20,450 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:20,451 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:20,452 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-02-20 23:37:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-02-20 23:37:20,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:20,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:20,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 40 states. [2022-02-20 23:37:20,453 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 40 states. [2022-02-20 23:37:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:20,454 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-02-20 23:37:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-02-20 23:37:20,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:20,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:20,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:20,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-02-20 23:37:20,457 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 5 [2022-02-20 23:37:20,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:20,457 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-02-20 23:37:20,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:37:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-02-20 23:37:20,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:37:20,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:20,458 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:20,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:37:20,458 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:37:20,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:20,459 INFO L85 PathProgramCache]: Analyzing trace with hash 620752485, now seen corresponding path program 1 times [2022-02-20 23:37:20,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:20,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660120109] [2022-02-20 23:37:20,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:20,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:20,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {391#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {391#true} is VALID [2022-02-20 23:37:20,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {391#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet4#1, main_#t~mem7#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {391#true} is VALID [2022-02-20 23:37:20,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {391#true} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {391#true} is VALID [2022-02-20 23:37:20,505 INFO L290 TraceCheckUtils]: 3: Hoare triple {391#true} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {393#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) (select |#valid| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:37:20,506 INFO L290 TraceCheckUtils]: 4: Hoare triple {393#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) (select |#valid| |ULTIMATE.start_main_~p~0#1.base|))} SUMMARY for call write~int(2, main_~a~0#1.base, main_~a~0#1.offset, 4); srcloc: L536 {394#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:37:20,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {394#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {394#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:37:20,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {394#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {394#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:37:20,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {394#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !(1 == #valid[main_~p~0#1.base]); {392#false} is VALID [2022-02-20 23:37:20,507 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:37:20,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:20,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660120109] [2022-02-20 23:37:20,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660120109] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:20,508 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:20,508 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:37:20,508 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848332986] [2022-02-20 23:37:20,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:20,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:20,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:20,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:20,515 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:37:20,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:37:20,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:20,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:37:20,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:37:20,516 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:20,692 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-02-20 23:37:20,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:37:20,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:20,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-02-20 23:37:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-02-20 23:37:20,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 84 transitions. [2022-02-20 23:37:20,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:20,775 INFO L225 Difference]: With dead ends: 71 [2022-02-20 23:37:20,776 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 23:37:20,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:37:20,780 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 68 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:20,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 31 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:20,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 23:37:20,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 44. [2022-02-20 23:37:20,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:20,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 44 states, 32 states have (on average 1.59375) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 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:37:20,788 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 44 states, 32 states have (on average 1.59375) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 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:37:20,789 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 44 states, 32 states have (on average 1.59375) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 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:37:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:20,793 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-02-20 23:37:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-02-20 23:37:20,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:20,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:20,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 32 states have (on average 1.59375) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 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 71 states. [2022-02-20 23:37:20,802 INFO L87 Difference]: Start difference. First operand has 44 states, 32 states have (on average 1.59375) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 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 71 states. [2022-02-20 23:37:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:20,805 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-02-20 23:37:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-02-20 23:37:20,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:20,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:20,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:20,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.59375) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 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:37:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-02-20 23:37:20,809 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 8 [2022-02-20 23:37:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:20,810 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-02-20 23:37:20,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-02-20 23:37:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:37:20,811 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:20,811 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:20,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:37:20,811 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:37:20,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:20,812 INFO L85 PathProgramCache]: Analyzing trace with hash 620752486, now seen corresponding path program 1 times [2022-02-20 23:37:20,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:20,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008866670] [2022-02-20 23:37:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:20,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:20,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {656#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {656#true} is VALID [2022-02-20 23:37:20,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {656#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet4#1, main_#t~mem7#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {658#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) 8))} is VALID [2022-02-20 23:37:20,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) 8))} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {658#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) 8))} is VALID [2022-02-20 23:37:20,894 INFO L290 TraceCheckUtils]: 3: Hoare triple {658#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) 8))} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {659#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:20,895 INFO L290 TraceCheckUtils]: 4: Hoare triple {659#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(2, main_~a~0#1.base, main_~a~0#1.offset, 4); srcloc: L536 {659#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:20,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {659#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:20,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {659#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:20,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(4 + main_~p~0#1.offset <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset); {657#false} is VALID [2022-02-20 23:37:20,898 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:37:20,898 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:20,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008866670] [2022-02-20 23:37:20,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008866670] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:20,899 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:20,899 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:37:20,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689172257] [2022-02-20 23:37:20,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:20,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:20,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:20,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:20,907 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:37:20,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:37:20,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:20,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:37:20,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:37:20,909 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:21,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:21,040 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-02-20 23:37:21,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:37:21,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:21,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-02-20 23:37:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-02-20 23:37:21,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2022-02-20 23:37:21,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:21,111 INFO L225 Difference]: With dead ends: 60 [2022-02-20 23:37:21,111 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 23:37:21,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:37:21,112 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 70 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:21,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 25 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:37:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 23:37:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2022-02-20 23:37:21,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:21,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 52 states, 40 states have (on average 1.45) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 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:37:21,115 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 52 states, 40 states have (on average 1.45) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 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:37:21,115 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 52 states, 40 states have (on average 1.45) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 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:37:21,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:21,117 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-02-20 23:37:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-02-20 23:37:21,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:21,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:21,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 40 states have (on average 1.45) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 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 60 states. [2022-02-20 23:37:21,118 INFO L87 Difference]: Start difference. First operand has 52 states, 40 states have (on average 1.45) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 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 60 states. [2022-02-20 23:37:21,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:21,119 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-02-20 23:37:21,120 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-02-20 23:37:21,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:21,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:21,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:21,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.45) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 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:37:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-02-20 23:37:21,122 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 8 [2022-02-20 23:37:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:21,123 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-02-20 23:37:21,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-02-20 23:37:21,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:37:21,123 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:21,124 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:21,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:37:21,124 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:37:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:21,125 INFO L85 PathProgramCache]: Analyzing trace with hash -244401734, now seen corresponding path program 1 times [2022-02-20 23:37:21,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:21,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496288058] [2022-02-20 23:37:21,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:21,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:21,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {896#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {896#true} is VALID [2022-02-20 23:37:21,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {896#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet4#1, main_#t~mem7#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {898#(not (= |ULTIMATE.start_main_~a~0#1.base| 0))} is VALID [2022-02-20 23:37:21,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {898#(not (= |ULTIMATE.start_main_~a~0#1.base| 0))} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {898#(not (= |ULTIMATE.start_main_~a~0#1.base| 0))} is VALID [2022-02-20 23:37:21,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {898#(not (= |ULTIMATE.start_main_~a~0#1.base| 0))} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {898#(not (= |ULTIMATE.start_main_~a~0#1.base| 0))} is VALID [2022-02-20 23:37:21,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {898#(not (= |ULTIMATE.start_main_~a~0#1.base| 0))} SUMMARY for call write~int(2, main_~a~0#1.base, main_~a~0#1.offset, 4); srcloc: L536 {898#(not (= |ULTIMATE.start_main_~a~0#1.base| 0))} is VALID [2022-02-20 23:37:21,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {898#(not (= |ULTIMATE.start_main_~a~0#1.base| 0))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {898#(not (= |ULTIMATE.start_main_~a~0#1.base| 0))} is VALID [2022-02-20 23:37:21,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {898#(not (= |ULTIMATE.start_main_~a~0#1.base| 0))} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {898#(not (= |ULTIMATE.start_main_~a~0#1.base| 0))} is VALID [2022-02-20 23:37:21,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {898#(not (= |ULTIMATE.start_main_~a~0#1.base| 0))} SUMMARY for call write~int(2, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L537-3 {898#(not (= |ULTIMATE.start_main_~a~0#1.base| 0))} is VALID [2022-02-20 23:37:21,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {898#(not (= |ULTIMATE.start_main_~a~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L544 {898#(not (= |ULTIMATE.start_main_~a~0#1.base| 0))} is VALID [2022-02-20 23:37:21,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {898#(not (= |ULTIMATE.start_main_~a~0#1.base| 0))} main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {899#(not (= 0 |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:37:21,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {899#(not (= 0 |ULTIMATE.start_main_~p~0#1.base|))} assume !(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0); {897#false} is VALID [2022-02-20 23:37:21,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {897#false} main_#res#1 := 0; {897#false} is VALID [2022-02-20 23:37:21,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {897#false} assume !(#valid == main_old_#valid#1); {897#false} is VALID [2022-02-20 23:37:21,177 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:37:21,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:21,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496288058] [2022-02-20 23:37:21,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496288058] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:21,177 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:21,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:37:21,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845852353] [2022-02-20 23:37:21,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:21,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:37:21,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:21,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:37:21,189 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:37:21,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:37:21,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:21,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:37:21,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:37:21,190 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:37:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:21,277 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-02-20 23:37:21,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:37:21,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:37:21,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:37:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-02-20 23:37:21,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:37:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-02-20 23:37:21,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2022-02-20 23:37:21,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:21,338 INFO L225 Difference]: With dead ends: 57 [2022-02-20 23:37:21,338 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 23:37:21,338 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:37:21,339 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 60 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:21,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 37 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:37:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 23:37:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2022-02-20 23:37:21,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:21,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 52 states, 40 states have (on average 1.4) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:21,341 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 52 states, 40 states have (on average 1.4) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:21,341 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 52 states, 40 states have (on average 1.4) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:21,343 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-02-20 23:37:21,343 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-02-20 23:37:21,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:21,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:21,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 40 states have (on average 1.4) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 57 states. [2022-02-20 23:37:21,343 INFO L87 Difference]: Start difference. First operand has 52 states, 40 states have (on average 1.4) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 57 states. [2022-02-20 23:37:21,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:21,344 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-02-20 23:37:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-02-20 23:37:21,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:21,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:21,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:21,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.4) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-02-20 23:37:21,345 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 13 [2022-02-20 23:37:21,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:21,346 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-02-20 23:37:21,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:37:21,346 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-02-20 23:37:21,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:37:21,346 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:21,346 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:21,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:37:21,346 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:37:21,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1013521738, now seen corresponding path program 1 times [2022-02-20 23:37:21,347 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:21,347 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625742641] [2022-02-20 23:37:21,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:21,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:21,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {1127#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {1127#true} is VALID [2022-02-20 23:37:21,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {1127#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet4#1, main_#t~mem7#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1127#true} is VALID [2022-02-20 23:37:21,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {1127#true} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {1127#true} is VALID [2022-02-20 23:37:21,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {1127#true} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {1129#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:37:21,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {1129#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} SUMMARY for call write~int(2, main_~a~0#1.base, main_~a~0#1.offset, 4); srcloc: L536 {1129#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:37:21,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {1129#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {1129#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:37:21,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {1129#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {1129#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:37:21,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {1129#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} SUMMARY for call write~int(2, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L537-3 {1130#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 2) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:37:21,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {1130#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 2) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L544 {1131#(= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)} is VALID [2022-02-20 23:37:21,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {1131#(= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)} main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {1132#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 2)} is VALID [2022-02-20 23:37:21,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {1132#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 2)} assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0); {1132#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 2)} is VALID [2022-02-20 23:37:21,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {1132#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 2)} SUMMARY for call main_#t~mem7#1 := read~int(main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L548 {1133#(= |ULTIMATE.start_main_#t~mem7#1| 2)} is VALID [2022-02-20 23:37:21,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {1133#(= |ULTIMATE.start_main_#t~mem7#1| 2)} assume 2 != main_#t~mem7#1;havoc main_#t~mem7#1; {1128#false} is VALID [2022-02-20 23:37:21,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {1128#false} assume !false; {1128#false} is VALID [2022-02-20 23:37:21,439 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:37:21,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:21,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625742641] [2022-02-20 23:37:21,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625742641] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:21,439 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:21,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:37:21,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736170691] [2022-02-20 23:37:21,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:21,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:37:21,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:21,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:37:21,449 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:37:21,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:37:21,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:21,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:37:21,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:37:21,450 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:37:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:21,717 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-02-20 23:37:21,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:37:21,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:37:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:37:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-02-20 23:37:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:37:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-02-20 23:37:21,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-02-20 23:37:21,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:21,771 INFO L225 Difference]: With dead ends: 73 [2022-02-20 23:37:21,771 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 23:37:21,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:37:21,772 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:21,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 110 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 23:37:21,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2022-02-20 23:37:21,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:21,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 53 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 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:37:21,775 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 53 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 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:37:21,775 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 53 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 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:37:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:21,777 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-02-20 23:37:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-02-20 23:37:21,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:21,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:21,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 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 73 states. [2022-02-20 23:37:21,778 INFO L87 Difference]: Start difference. First operand has 53 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 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 73 states. [2022-02-20 23:37:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:21,779 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-02-20 23:37:21,779 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-02-20 23:37:21,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:21,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:21,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:21,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 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:37:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-02-20 23:37:21,781 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 14 [2022-02-20 23:37:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:21,781 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-02-20 23:37:21,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:37:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-02-20 23:37:21,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:37:21,782 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:21,782 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:21,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:37:21,782 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:37:21,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:21,783 INFO L85 PathProgramCache]: Analyzing trace with hash 468354904, now seen corresponding path program 1 times [2022-02-20 23:37:21,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:21,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101498485] [2022-02-20 23:37:21,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:21,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:21,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {1410#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {1410#true} is VALID [2022-02-20 23:37:21,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {1410#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet4#1, main_#t~mem7#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1410#true} is VALID [2022-02-20 23:37:21,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {1410#true} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {1410#true} is VALID [2022-02-20 23:37:21,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {1410#true} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {1410#true} is VALID [2022-02-20 23:37:21,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {1410#true} SUMMARY for call write~int(2, main_~a~0#1.base, main_~a~0#1.offset, 4); srcloc: L536 {1410#true} is VALID [2022-02-20 23:37:21,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {1410#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {1410#true} is VALID [2022-02-20 23:37:21,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {1410#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {1410#true} is VALID [2022-02-20 23:37:21,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {1410#true} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L538 {1410#true} is VALID [2022-02-20 23:37:21,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {1410#true} call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset; {1412#(= (select |#valid| |ULTIMATE.start_main_~t~0#1.base|) 1)} is VALID [2022-02-20 23:37:21,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {1412#(= (select |#valid| |ULTIMATE.start_main_~t~0#1.base|) 1)} assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); {1412#(= (select |#valid| |ULTIMATE.start_main_~t~0#1.base|) 1)} is VALID [2022-02-20 23:37:21,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {1412#(= (select |#valid| |ULTIMATE.start_main_~t~0#1.base|) 1)} SUMMARY for call write~$Pointer$(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L540-3 {1413#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:37:21,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {1413#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4))) 1)} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L541 {1414#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} is VALID [2022-02-20 23:37:21,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {1414#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {1415#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:37:21,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {1415#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {1415#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:37:21,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {1415#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {1415#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:37:21,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {1415#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !(1 == #valid[main_~p~0#1.base]); {1411#false} is VALID [2022-02-20 23:37:21,845 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:37:21,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:21,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101498485] [2022-02-20 23:37:21,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101498485] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:21,845 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:21,845 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:37:21,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393954279] [2022-02-20 23:37:21,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:21,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:37:21,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:21,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:21,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:21,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:37:21,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:21,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:37:21,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:37:21,856 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:22,070 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-02-20 23:37:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:37:22,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:37:22,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-02-20 23:37:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-02-20 23:37:22,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-02-20 23:37:22,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:22,112 INFO L225 Difference]: With dead ends: 65 [2022-02-20 23:37:22,112 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 23:37:22,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:37:22,113 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 44 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:22,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 94 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 23:37:22,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2022-02-20 23:37:22,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:22,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 51 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,115 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 51 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,116 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 51 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:22,117 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-02-20 23:37:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-02-20 23:37:22,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:22,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:22,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 65 states. [2022-02-20 23:37:22,118 INFO L87 Difference]: Start difference. First operand has 51 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 65 states. [2022-02-20 23:37:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:22,119 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-02-20 23:37:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-02-20 23:37:22,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:22,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:22,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:22,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-02-20 23:37:22,120 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 16 [2022-02-20 23:37:22,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:22,121 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-02-20 23:37:22,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,121 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-02-20 23:37:22,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:37:22,121 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:22,121 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:22,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:37:22,122 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:37:22,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:22,122 INFO L85 PathProgramCache]: Analyzing trace with hash 468354905, now seen corresponding path program 1 times [2022-02-20 23:37:22,122 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:22,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837474587] [2022-02-20 23:37:22,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:22,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:22,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {1671#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {1671#true} is VALID [2022-02-20 23:37:22,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet4#1, main_#t~mem7#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1671#true} is VALID [2022-02-20 23:37:22,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {1671#true} is VALID [2022-02-20 23:37:22,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {1671#true} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {1671#true} is VALID [2022-02-20 23:37:22,223 INFO L290 TraceCheckUtils]: 4: Hoare triple {1671#true} SUMMARY for call write~int(2, main_~a~0#1.base, main_~a~0#1.offset, 4); srcloc: L536 {1671#true} is VALID [2022-02-20 23:37:22,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {1671#true} is VALID [2022-02-20 23:37:22,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {1671#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {1671#true} is VALID [2022-02-20 23:37:22,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {1671#true} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L538 {1671#true} is VALID [2022-02-20 23:37:22,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {1671#true} call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset; {1673#(and (<= 8 (select |#length| |ULTIMATE.start_main_~t~0#1.base|)) (= |ULTIMATE.start_main_~t~0#1.offset| 0))} is VALID [2022-02-20 23:37:22,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {1673#(and (<= 8 (select |#length| |ULTIMATE.start_main_~t~0#1.base|)) (= |ULTIMATE.start_main_~t~0#1.offset| 0))} assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); {1673#(and (<= 8 (select |#length| |ULTIMATE.start_main_~t~0#1.base|)) (= |ULTIMATE.start_main_~t~0#1.offset| 0))} is VALID [2022-02-20 23:37:22,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {1673#(and (<= 8 (select |#length| |ULTIMATE.start_main_~t~0#1.base|)) (= |ULTIMATE.start_main_~t~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L540-3 {1674#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)))))} is VALID [2022-02-20 23:37:22,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {1674#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)))))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L541 {1675#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem6#1.base|)))} is VALID [2022-02-20 23:37:22,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {1675#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem6#1.base|)))} main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {1676#(and (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-20 23:37:22,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {1676#(and (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {1676#(and (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-20 23:37:22,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {1676#(and (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {1676#(and (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-20 23:37:22,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {1676#(and (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} assume !(4 + main_~p~0#1.offset <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset); {1672#false} is VALID [2022-02-20 23:37:22,228 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:37:22,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:22,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837474587] [2022-02-20 23:37:22,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837474587] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:22,229 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:22,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:37:22,229 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154691266] [2022-02-20 23:37:22,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:22,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:37:22,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:22,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:22,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:37:22,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:22,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:37:22,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:37:22,241 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:22,516 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-02-20 23:37:22,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:37:22,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:37:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-02-20 23:37:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-02-20 23:37:22,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-02-20 23:37:22,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:22,559 INFO L225 Difference]: With dead ends: 61 [2022-02-20 23:37:22,559 INFO L226 Difference]: Without dead ends: 61 [2022-02-20 23:37:22,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:37:22,560 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:22,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 112 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:22,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-20 23:37:22,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 41. [2022-02-20 23:37:22,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:22,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 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:37:22,562 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 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:37:22,562 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 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:37:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:22,563 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-02-20 23:37:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-02-20 23:37:22,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:22,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:22,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 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 61 states. [2022-02-20 23:37:22,564 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 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 61 states. [2022-02-20 23:37:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:22,565 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-02-20 23:37:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-02-20 23:37:22,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:22,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:22,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:22,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 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:37:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-02-20 23:37:22,566 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 16 [2022-02-20 23:37:22,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:22,566 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-02-20 23:37:22,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-02-20 23:37:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:37:22,567 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:22,567 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:22,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:37:22,567 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:37:22,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:22,568 INFO L85 PathProgramCache]: Analyzing trace with hash 210852361, now seen corresponding path program 1 times [2022-02-20 23:37:22,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:22,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841841213] [2022-02-20 23:37:22,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:22,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {1914#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {1914#true} is VALID [2022-02-20 23:37:22,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {1914#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet4#1, main_#t~mem7#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1916#(= |ULTIMATE.start_main_~a~0#1.offset| 0)} is VALID [2022-02-20 23:37:22,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {1916#(= |ULTIMATE.start_main_~a~0#1.offset| 0)} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {1916#(= |ULTIMATE.start_main_~a~0#1.offset| 0)} is VALID [2022-02-20 23:37:22,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {1916#(= |ULTIMATE.start_main_~a~0#1.offset| 0)} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {1917#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:22,675 INFO L290 TraceCheckUtils]: 4: Hoare triple {1917#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(2, main_~a~0#1.base, main_~a~0#1.offset, 4); srcloc: L536 {1917#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:22,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {1917#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {1917#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:22,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {1917#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {1917#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:22,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {1917#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(2, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L537-3 {1917#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:22,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {1917#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L544 {1918#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~a~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~a~0#1.base|) 4) 0))} is VALID [2022-02-20 23:37:22,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {1918#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~a~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~a~0#1.base|) 4) 0))} main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {1919#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:22,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {1919#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0); {1919#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:22,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {1919#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call main_#t~mem7#1 := read~int(main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L548 {1919#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:22,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {1919#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(2 != main_#t~mem7#1);havoc main_#t~mem7#1; {1919#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:22,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {1919#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L548-3 {1920#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= |ULTIMATE.start_main_#t~mem8#1.base| 0))} is VALID [2022-02-20 23:37:22,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {1920#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= |ULTIMATE.start_main_#t~mem8#1.base| 0))} main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {1921#(and (= 0 |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:22,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {1921#(and (= 0 |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0); {1915#false} is VALID [2022-02-20 23:37:22,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {1915#false} assume !(1 == #valid[main_~p~0#1.base]); {1915#false} is VALID [2022-02-20 23:37:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:22,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:22,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841841213] [2022-02-20 23:37:22,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841841213] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:37:22,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082636931] [2022-02-20 23:37:22,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:22,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:37:22,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:37:22,684 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:37:22,685 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:37:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:22,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 23:37:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:22,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:22,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:37:22,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:37:23,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:37:23,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:37:23,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {1914#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {1914#true} is VALID [2022-02-20 23:37:23,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {1914#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet4#1, main_#t~mem7#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1928#(<= |ULTIMATE.start_main_~a~0#1.offset| 0)} is VALID [2022-02-20 23:37:23,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {1928#(<= |ULTIMATE.start_main_~a~0#1.offset| 0)} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {1928#(<= |ULTIMATE.start_main_~a~0#1.offset| 0)} is VALID [2022-02-20 23:37:23,104 INFO L290 TraceCheckUtils]: 3: Hoare triple {1928#(<= |ULTIMATE.start_main_~a~0#1.offset| 0)} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {1935#(and (<= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0))} is VALID [2022-02-20 23:37:23,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {1935#(and (<= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0))} SUMMARY for call write~int(2, main_~a~0#1.base, main_~a~0#1.offset, 4); srcloc: L536 {1935#(and (<= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0))} is VALID [2022-02-20 23:37:23,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {1935#(and (<= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {1935#(and (<= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0))} is VALID [2022-02-20 23:37:23,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {1935#(and (<= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0))} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {1935#(and (<= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0))} is VALID [2022-02-20 23:37:23,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {1935#(and (<= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0))} SUMMARY for call write~int(2, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L537-3 {1917#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:23,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {1917#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L544 {1918#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~a~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~a~0#1.base|) 4) 0))} is VALID [2022-02-20 23:37:23,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {1918#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~a~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~a~0#1.base|) 4) 0))} main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {1954#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) 4) 0) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) 4) 0))} is VALID [2022-02-20 23:37:23,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {1954#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) 4) 0) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) 4) 0))} assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0); {1954#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) 4) 0) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) 4) 0))} is VALID [2022-02-20 23:37:23,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {1954#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) 4) 0) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) 4) 0))} SUMMARY for call main_#t~mem7#1 := read~int(main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L548 {1919#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:23,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {1919#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(2 != main_#t~mem7#1);havoc main_#t~mem7#1; {1919#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:23,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {1919#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L548-3 {1920#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= |ULTIMATE.start_main_#t~mem8#1.base| 0))} is VALID [2022-02-20 23:37:23,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {1920#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= |ULTIMATE.start_main_#t~mem8#1.base| 0))} main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {1921#(and (= 0 |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:23,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {1921#(and (= 0 |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0); {1915#false} is VALID [2022-02-20 23:37:23,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {1915#false} assume !(1 == #valid[main_~p~0#1.base]); {1915#false} is VALID [2022-02-20 23:37:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:23,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:37:23,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2022-02-20 23:37:23,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-02-20 23:37:23,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {1915#false} assume !(1 == #valid[main_~p~0#1.base]); {1915#false} is VALID [2022-02-20 23:37:23,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {1921#(and (= 0 |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0); {1915#false} is VALID [2022-02-20 23:37:23,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {1920#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= |ULTIMATE.start_main_#t~mem8#1.base| 0))} main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {1921#(and (= 0 |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:37:23,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {1985#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L548-3 {1920#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= |ULTIMATE.start_main_#t~mem8#1.base| 0))} is VALID [2022-02-20 23:37:23,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {1985#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0))} assume !(2 != main_#t~mem7#1);havoc main_#t~mem7#1; {1985#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:37:23,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {1992#(or (not (<= 0 |ULTIMATE.start_main_~p~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))} SUMMARY for call main_#t~mem7#1 := read~int(main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L548 {1985#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:37:23,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {1992#(or (not (<= 0 |ULTIMATE.start_main_~p~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))} assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0); {1992#(or (not (<= 0 |ULTIMATE.start_main_~p~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))} is VALID [2022-02-20 23:37:23,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {1999#(forall ((|v_ULTIMATE.start_main_~p~0#1.offset_23| Int)) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_23| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_23| 4)) 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_23|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_23| |ULTIMATE.start_main_~a~0#1.offset|))))} main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {1992#(or (not (<= 0 |ULTIMATE.start_main_~p~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))} is VALID [2022-02-20 23:37:23,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {2003#(and (or (<= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~a~0#1.offset| 0)) (or (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (< |ULTIMATE.start_main_~a~0#1.offset| 0)) (or (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (< |ULTIMATE.start_main_~a~0#1.offset| 0)))} SUMMARY for call write~$Pointer$(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L544 {1999#(forall ((|v_ULTIMATE.start_main_~p~0#1.offset_23| Int)) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_23| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_23| 4)) 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_23|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_23| |ULTIMATE.start_main_~a~0#1.offset|))))} is VALID [2022-02-20 23:37:23,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {2007#(or (not (<= 0 |ULTIMATE.start_main_~p~0#1.offset|)) (and (or (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (< |ULTIMATE.start_main_~a~0#1.offset| 0)) (<= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (or (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (< |ULTIMATE.start_main_~a~0#1.offset| 0))))} SUMMARY for call write~int(2, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L537-3 {2003#(and (or (<= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (< |ULTIMATE.start_main_~a~0#1.offset| 0)) (or (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (< |ULTIMATE.start_main_~a~0#1.offset| 0)) (or (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (< |ULTIMATE.start_main_~a~0#1.offset| 0)))} is VALID [2022-02-20 23:37:23,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {2007#(or (not (<= 0 |ULTIMATE.start_main_~p~0#1.offset|)) (and (or (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (< |ULTIMATE.start_main_~a~0#1.offset| 0)) (<= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (or (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (< |ULTIMATE.start_main_~a~0#1.offset| 0))))} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {2007#(or (not (<= 0 |ULTIMATE.start_main_~p~0#1.offset|)) (and (or (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (< |ULTIMATE.start_main_~a~0#1.offset| 0)) (<= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (or (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (< |ULTIMATE.start_main_~a~0#1.offset| 0))))} is VALID [2022-02-20 23:37:23,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {2007#(or (not (<= 0 |ULTIMATE.start_main_~p~0#1.offset|)) (and (or (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (< |ULTIMATE.start_main_~a~0#1.offset| 0)) (<= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (or (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (< |ULTIMATE.start_main_~a~0#1.offset| 0))))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {2007#(or (not (<= 0 |ULTIMATE.start_main_~p~0#1.offset|)) (and (or (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (< |ULTIMATE.start_main_~a~0#1.offset| 0)) (<= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (or (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (< |ULTIMATE.start_main_~a~0#1.offset| 0))))} is VALID [2022-02-20 23:37:23,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {2007#(or (not (<= 0 |ULTIMATE.start_main_~p~0#1.offset|)) (and (or (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (< |ULTIMATE.start_main_~a~0#1.offset| 0)) (<= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (or (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (< |ULTIMATE.start_main_~a~0#1.offset| 0))))} SUMMARY for call write~int(2, main_~a~0#1.base, main_~a~0#1.offset, 4); srcloc: L536 {2007#(or (not (<= 0 |ULTIMATE.start_main_~p~0#1.offset|)) (and (or (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (< |ULTIMATE.start_main_~a~0#1.offset| 0)) (<= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (or (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (< |ULTIMATE.start_main_~a~0#1.offset| 0))))} is VALID [2022-02-20 23:37:23,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {1928#(<= |ULTIMATE.start_main_~a~0#1.offset| 0)} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {2007#(or (not (<= 0 |ULTIMATE.start_main_~p~0#1.offset|)) (and (or (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (< |ULTIMATE.start_main_~a~0#1.offset| 0)) (<= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (or (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (< |ULTIMATE.start_main_~a~0#1.offset| 0))))} is VALID [2022-02-20 23:37:23,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {1928#(<= |ULTIMATE.start_main_~a~0#1.offset| 0)} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {1928#(<= |ULTIMATE.start_main_~a~0#1.offset| 0)} is VALID [2022-02-20 23:37:23,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {1914#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet4#1, main_#t~mem7#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1928#(<= |ULTIMATE.start_main_~a~0#1.offset| 0)} is VALID [2022-02-20 23:37:23,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {1914#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2); {1914#true} is VALID [2022-02-20 23:37:23,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:23,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082636931] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:37:23,727 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:37:23,727 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 16 [2022-02-20 23:37:23,727 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186957115] [2022-02-20 23:37:23,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:37:23,727 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 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 17 [2022-02-20 23:37:23,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:23,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 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:37:23,754 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:37:23,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:37:23,754 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:23,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:37:23,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:37:23,755 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 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:37:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:24,120 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-02-20 23:37:24,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:37:24,120 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 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 17 [2022-02-20 23:37:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 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:37:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2022-02-20 23:37:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 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:37:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2022-02-20 23:37:24,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 59 transitions. [2022-02-20 23:37:24,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:24,164 INFO L225 Difference]: With dead ends: 57 [2022-02-20 23:37:24,164 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 23:37:24,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:37:24,165 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 160 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:24,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 106 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 117 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2022-02-20 23:37:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 23:37:24,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2022-02-20 23:37:24,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:24,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:24,167 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:24,167 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:24,168 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-02-20 23:37:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-02-20 23:37:24,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:24,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:24,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 57 states. [2022-02-20 23:37:24,168 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 57 states. [2022-02-20 23:37:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:24,169 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-02-20 23:37:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-02-20 23:37:24,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:24,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:24,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:24,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:24,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-02-20 23:37:24,170 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 17 [2022-02-20 23:37:24,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:24,170 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-02-20 23:37:24,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 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:37:24,170 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-02-20 23:37:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:37:24,170 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:24,170 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:24,190 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:37:24,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:37:24,376 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 14 more)] === [2022-02-20 23:37:24,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:24,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2053512678, now seen corresponding path program 1 times [2022-02-20 23:37:24,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:24,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516611614] [2022-02-20 23:37:24,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:24,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:37:24,402 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:37:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:37:24,435 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:37:24,435 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:37:24,436 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK (17 of 18 remaining) [2022-02-20 23:37:24,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (16 of 18 remaining) [2022-02-20 23:37:24,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (15 of 18 remaining) [2022-02-20 23:37:24,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (14 of 18 remaining) [2022-02-20 23:37:24,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (13 of 18 remaining) [2022-02-20 23:37:24,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (12 of 18 remaining) [2022-02-20 23:37:24,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (11 of 18 remaining) [2022-02-20 23:37:24,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (10 of 18 remaining) [2022-02-20 23:37:24,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (9 of 18 remaining) [2022-02-20 23:37:24,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (8 of 18 remaining) [2022-02-20 23:37:24,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (7 of 18 remaining) [2022-02-20 23:37:24,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (6 of 18 remaining) [2022-02-20 23:37:24,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (5 of 18 remaining) [2022-02-20 23:37:24,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (4 of 18 remaining) [2022-02-20 23:37:24,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (3 of 18 remaining) [2022-02-20 23:37:24,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (2 of 18 remaining) [2022-02-20 23:37:24,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (1 of 18 remaining) [2022-02-20 23:37:24,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (0 of 18 remaining) [2022-02-20 23:37:24,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:37:24,440 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:24,442 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:37:24,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:37:24 BoogieIcfgContainer [2022-02-20 23:37:24,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:37:24,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:37:24,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:37:24,474 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:37:24,474 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:37:19" (3/4) ... [2022-02-20 23:37:24,475 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:37:24,513 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:37:24,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:37:24,514 INFO L158 Benchmark]: Toolchain (without parser) took 5605.87ms. Allocated memory was 98.6MB in the beginning and 148.9MB in the end (delta: 50.3MB). Free memory was 66.8MB in the beginning and 115.0MB in the end (delta: -48.3MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. [2022-02-20 23:37:24,514 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 55.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:37:24,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.44ms. Allocated memory is still 98.6MB. Free memory was 66.5MB in the beginning and 65.7MB in the end (delta: 777.7kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:37:24,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.66ms. Allocated memory is still 98.6MB. Free memory was 65.7MB in the beginning and 64.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:37:24,515 INFO L158 Benchmark]: Boogie Preprocessor took 26.88ms. Allocated memory is still 98.6MB. Free memory was 64.0MB in the beginning and 62.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:37:24,515 INFO L158 Benchmark]: RCFGBuilder took 431.55ms. Allocated memory is still 98.6MB. Free memory was 62.3MB in the beginning and 46.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 23:37:24,515 INFO L158 Benchmark]: TraceAbstraction took 4728.34ms. Allocated memory was 98.6MB in the beginning and 148.9MB in the end (delta: 50.3MB). Free memory was 45.6MB in the beginning and 117.1MB in the end (delta: -71.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:37:24,516 INFO L158 Benchmark]: Witness Printer took 39.73ms. Allocated memory is still 148.9MB. Free memory was 117.1MB in the beginning and 115.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:37:24,519 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 55.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.44ms. Allocated memory is still 98.6MB. Free memory was 66.5MB in the beginning and 65.7MB in the end (delta: 777.7kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.66ms. Allocated memory is still 98.6MB. Free memory was 65.7MB in the beginning and 64.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.88ms. Allocated memory is still 98.6MB. Free memory was 64.0MB in the beginning and 62.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 431.55ms. Allocated memory is still 98.6MB. Free memory was 62.3MB in the beginning and 46.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4728.34ms. Allocated memory was 98.6MB in the beginning and 148.9MB in the end (delta: 50.3MB). Free memory was 45.6MB in the beginning and 117.1MB in the end (delta: -71.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 39.73ms. Allocated memory is still 148.9MB. Free memory was 117.1MB in the beginning and 115.0MB in the end (delta: 2.1MB). 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 - CounterExampleResult [Line: 531]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={-1:0}] [L534] List t; [L535] List p = a; VAL [a={-1:0}, p={-1:0}] [L536] a->h = 2 VAL [a={-1:0}, p={-1:0}] [L537] COND FALSE !(__VERIFIER_nondet_int()) [L544] p->h = 2 VAL [a={-1:0}, p={-1:0}] [L545] p->n = 0 VAL [a={-1:0}, p={-1:0}] [L546] p = a VAL [a={-1:0}, p={-1:0}] [L547] COND TRUE p!=0 VAL [a={-1:0}, p={-1:0}] [L548] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=2] [L548] COND FALSE !(p->h != 2) [L551] EXPR p->n VAL [a={-1:0}, p={-1:0}, p->n={0:0}] [L551] p = p->n [L547] COND FALSE !(p!=0) VAL [a={-1:0}, p={0:0}] [L553] return 0; VAL [\result=0, a={-1:0}, p={0:0}] - UnprovableResult [Line: 536]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 536]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 541 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 541 mSDsluCounter, 566 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19 IncrementalHoareTripleChecker+Unchecked, 344 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 672 IncrementalHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 222 mSDtfsCounter, 672 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=6, InterpolantAutomatonStates: 50, 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, 107 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 125 ConstructedInterpolants, 1 QuantifiedInterpolants, 978 SizeOfPredicates, 10 NumberOfNonLiveVariables, 118 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 7/10 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 RESULT: Ultimate proved your program to be incorrect! [2022-02-20 23:37:24,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)