./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:46:42,183 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:46:42,185 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:46:42,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:46:42,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:46:42,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:46:42,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:46:42,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:46:42,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:46:42,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:46:42,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:46:42,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:46:42,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:46:42,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:46:42,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:46:42,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:46:42,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:46:42,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:46:42,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:46:42,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:46:42,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:46:42,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:46:42,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:46:42,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:46:42,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:46:42,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:46:42,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:46:42,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:46:42,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:46:42,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:46:42,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:46:42,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:46:42,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:46:42,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:46:42,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:46:42,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:46:42,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:46:42,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:46:42,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:46:42,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:46:42,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:46:42,270 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:46:42,290 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:46:42,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:46:42,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:46:42,292 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:46:42,294 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:46:42,294 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:46:42,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:46:42,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:46:42,295 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:46:42,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:46:42,296 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:46:42,297 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:46:42,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:46:42,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:46:42,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:46:42,297 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:46:42,298 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:46:42,298 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:46:42,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:46:42,298 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:46:42,298 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:46:42,298 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:46:42,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:46:42,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:46:42,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:46:42,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:42,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:46:42,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:46:42,301 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:46:42,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:46:42,302 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2022-02-20 23:46:42,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:46:42,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:46:42,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:46:42,538 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:46:42,539 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:46:42,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2022-02-20 23:46:42,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f87c49a5/1c384c8b41424c109da7f62e463a37f2/FLAGc06b5586f [2022-02-20 23:46:43,071 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:46:43,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2022-02-20 23:46:43,090 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f87c49a5/1c384c8b41424c109da7f62e463a37f2/FLAGc06b5586f [2022-02-20 23:46:43,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f87c49a5/1c384c8b41424c109da7f62e463a37f2 [2022-02-20 23:46:43,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:46:43,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:46:43,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:43,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:46:43,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:46:43,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:43" (1/1) ... [2022-02-20 23:46:43,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@394a0432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:43, skipping insertion in model container [2022-02-20 23:46:43,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:43" (1/1) ... [2022-02-20 23:46:43,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:46:43,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:46:43,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:43,428 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:46:43,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:43,496 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:46:43,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:43 WrapperNode [2022-02-20 23:46:43,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:43,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:46:43,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:46:43,498 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:46:43,505 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:46:43" (1/1) ... [2022-02-20 23:46:43,533 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:46:43" (1/1) ... [2022-02-20 23:46:43,574 INFO L137 Inliner]: procedures = 123, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2022-02-20 23:46:43,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:46:43,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:46:43,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:46:43,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:46:43,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:43" (1/1) ... [2022-02-20 23:46:43,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:43" (1/1) ... [2022-02-20 23:46:43,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:43" (1/1) ... [2022-02-20 23:46:43,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:43" (1/1) ... [2022-02-20 23:46:43,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:43" (1/1) ... [2022-02-20 23:46:43,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:43" (1/1) ... [2022-02-20 23:46:43,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:43" (1/1) ... [2022-02-20 23:46:43,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:46:43,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:46:43,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:46:43,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:46:43,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:43" (1/1) ... [2022-02-20 23:46:43,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:43,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:43,660 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:46:43,673 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:46:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:46:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:46:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:46:43,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:46:43,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:46:43,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:46:43,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:46:43,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:46:43,801 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:46:43,802 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:46:44,631 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:46:44,643 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:46:44,644 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-02-20 23:46:44,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:46:44 BoogieIcfgContainer [2022-02-20 23:46:44,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:46:44,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:46:44,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:46:44,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:46:44,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:46:43" (1/3) ... [2022-02-20 23:46:44,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dee73be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:46:44, skipping insertion in model container [2022-02-20 23:46:44,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:43" (2/3) ... [2022-02-20 23:46:44,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dee73be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:46:44, skipping insertion in model container [2022-02-20 23:46:44,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:46:44" (3/3) ... [2022-02-20 23:46:44,656 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2022-02-20 23:46:44,661 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:46:44,662 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2022-02-20 23:46:44,711 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:46:44,721 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:46:44,721 INFO L340 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-02-20 23:46:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 105 states have (on average 2.219047619047619) internal successors, (233), 209 states have internal predecessors, (233), 0 states have call successors, (0), 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:46:44,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:46:44,763 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:44,764 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:46:44,764 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:46:44,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:44,769 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:46:44,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:44,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698285532] [2022-02-20 23:46:44,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:44,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:44,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {213#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(16, 2); {213#true} is VALID [2022-02-20 23:46:44,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {215#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:44,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} assume !(1 == #valid[main_~tree~0#1.base]); {214#false} is VALID [2022-02-20 23:46:44,922 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:46:44,922 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:44,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698285532] [2022-02-20 23:46:44,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698285532] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:44,923 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:44,923 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:44,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897847916] [2022-02-20 23:46:44,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:44,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-20 23:46:44,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:44,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:46:44,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:44,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:44,938 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:44,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:44,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:44,970 INFO L87 Difference]: Start difference. First operand has 210 states, 105 states have (on average 2.219047619047619) internal successors, (233), 209 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:46:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:45,523 INFO L93 Difference]: Finished difference Result 282 states and 304 transitions. [2022-02-20 23:46:45,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:45,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-20 23:46:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:46:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2022-02-20 23:46:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:46:45,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2022-02-20 23:46:45,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 323 transitions. [2022-02-20 23:46:45,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 323 edges. 323 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:45,835 INFO L225 Difference]: With dead ends: 282 [2022-02-20 23:46:45,835 INFO L226 Difference]: Without dead ends: 278 [2022-02-20 23:46:45,837 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:46:45,839 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 200 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:45,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 199 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:45,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-02-20 23:46:45,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 199. [2022-02-20 23:46:45,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:45,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states. Second operand has 199 states, 104 states have (on average 2.0673076923076925) internal successors, (215), 198 states have internal predecessors, (215), 0 states have call successors, (0), 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:46:45,892 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states. Second operand has 199 states, 104 states have (on average 2.0673076923076925) internal successors, (215), 198 states have internal predecessors, (215), 0 states have call successors, (0), 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:46:45,893 INFO L87 Difference]: Start difference. First operand 278 states. Second operand has 199 states, 104 states have (on average 2.0673076923076925) internal successors, (215), 198 states have internal predecessors, (215), 0 states have call successors, (0), 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:46:45,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:45,910 INFO L93 Difference]: Finished difference Result 278 states and 300 transitions. [2022-02-20 23:46:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 300 transitions. [2022-02-20 23:46:45,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:45,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:45,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 104 states have (on average 2.0673076923076925) internal successors, (215), 198 states have internal predecessors, (215), 0 states have call successors, (0), 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 278 states. [2022-02-20 23:46:45,920 INFO L87 Difference]: Start difference. First operand has 199 states, 104 states have (on average 2.0673076923076925) internal successors, (215), 198 states have internal predecessors, (215), 0 states have call successors, (0), 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 278 states. [2022-02-20 23:46:45,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:45,941 INFO L93 Difference]: Finished difference Result 278 states and 300 transitions. [2022-02-20 23:46:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 300 transitions. [2022-02-20 23:46:45,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:45,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:45,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:45,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 104 states have (on average 2.0673076923076925) internal successors, (215), 198 states have internal predecessors, (215), 0 states have call successors, (0), 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:46:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2022-02-20 23:46:45,956 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 3 [2022-02-20 23:46:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:45,956 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2022-02-20 23:46:45,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:46:45,957 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2022-02-20 23:46:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:46:45,958 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:45,958 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:46:45,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:46:45,959 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:46:45,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:45,961 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:46:45,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:45,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239336915] [2022-02-20 23:46:45,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:45,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:46,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {1255#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(16, 2); {1255#true} is VALID [2022-02-20 23:46:46,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {1255#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {1257#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:46,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} assume !(4 + main_~tree~0#1.offset <= #length[main_~tree~0#1.base] && 0 <= main_~tree~0#1.offset); {1256#false} is VALID [2022-02-20 23:46:46,020 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:46:46,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:46,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239336915] [2022-02-20 23:46:46,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239336915] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:46,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:46,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:46,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574136455] [2022-02-20 23:46:46,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:46,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-20 23:46:46,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:46,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:46:46,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:46,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:46,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:46,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:46,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:46,028 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:46:46,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:46,333 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2022-02-20 23:46:46,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:46,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-20 23:46:46,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:46:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2022-02-20 23:46:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:46:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2022-02-20 23:46:46,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 215 transitions. [2022-02-20 23:46:46,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:46,507 INFO L225 Difference]: With dead ends: 197 [2022-02-20 23:46:46,507 INFO L226 Difference]: Without dead ends: 197 [2022-02-20 23:46:46,507 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:46:46,508 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:46,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-02-20 23:46:46,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-02-20 23:46:46,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:46,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 197 states, 104 states have (on average 2.048076923076923) internal successors, (213), 196 states have internal predecessors, (213), 0 states have call successors, (0), 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:46:46,527 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 197 states, 104 states have (on average 2.048076923076923) internal successors, (213), 196 states have internal predecessors, (213), 0 states have call successors, (0), 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:46:46,529 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 197 states, 104 states have (on average 2.048076923076923) internal successors, (213), 196 states have internal predecessors, (213), 0 states have call successors, (0), 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:46:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:46,535 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2022-02-20 23:46:46,535 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2022-02-20 23:46:46,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:46,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:46,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 104 states have (on average 2.048076923076923) internal successors, (213), 196 states have internal predecessors, (213), 0 states have call successors, (0), 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 197 states. [2022-02-20 23:46:46,537 INFO L87 Difference]: Start difference. First operand has 197 states, 104 states have (on average 2.048076923076923) internal successors, (213), 196 states have internal predecessors, (213), 0 states have call successors, (0), 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 197 states. [2022-02-20 23:46:46,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:46,542 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2022-02-20 23:46:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2022-02-20 23:46:46,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:46,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:46,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:46,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 104 states have (on average 2.048076923076923) internal successors, (213), 196 states have internal predecessors, (213), 0 states have call successors, (0), 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:46:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2022-02-20 23:46:46,548 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 3 [2022-02-20 23:46:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:46,549 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2022-02-20 23:46:46,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:46:46,549 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2022-02-20 23:46:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:46:46,549 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:46,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:46:46,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:46:46,550 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:46:46,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:46,551 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2022-02-20 23:46:46,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:46,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713712673] [2022-02-20 23:46:46,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:46,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:46,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {2048#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(16, 2); {2048#true} is VALID [2022-02-20 23:46:46,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {2048#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {2050#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 12))} is VALID [2022-02-20 23:46:46,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {2050#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 12))} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {2051#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 12))} is VALID [2022-02-20 23:46:46,650 INFO L290 TraceCheckUtils]: 3: Hoare triple {2051#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 12))} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {2051#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 12))} is VALID [2022-02-20 23:46:46,651 INFO L290 TraceCheckUtils]: 4: Hoare triple {2051#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 12))} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {2050#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 12))} is VALID [2022-02-20 23:46:46,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {2050#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 12))} assume !(4 + (8 + main_~tree~0#1.offset) <= #length[main_~tree~0#1.base] && 0 <= 8 + main_~tree~0#1.offset); {2049#false} is VALID [2022-02-20 23:46:46,652 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:46:46,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:46,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713712673] [2022-02-20 23:46:46,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713712673] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:46,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:46,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:46,653 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404939214] [2022-02-20 23:46:46,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:46,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 23:46:46,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:46,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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:46:46,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:46,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:46:46,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:46,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:46:46,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:46:46,661 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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:46:47,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:47,316 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2022-02-20 23:46:47,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:46:47,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 23:46:47,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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:46:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 389 transitions. [2022-02-20 23:46:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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:46:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 389 transitions. [2022-02-20 23:46:47,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 389 transitions. [2022-02-20 23:46:47,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 389 edges. 389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:47,637 INFO L225 Difference]: With dead ends: 354 [2022-02-20 23:46:47,637 INFO L226 Difference]: Without dead ends: 354 [2022-02-20 23:46:47,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:46:47,638 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 466 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:47,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [466 Valid, 202 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:47,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-02-20 23:46:47,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 190. [2022-02-20 23:46:47,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:47,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 354 states. Second operand has 190 states, 104 states have (on average 1.9807692307692308) internal successors, (206), 189 states have internal predecessors, (206), 0 states have call successors, (0), 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:46:47,645 INFO L74 IsIncluded]: Start isIncluded. First operand 354 states. Second operand has 190 states, 104 states have (on average 1.9807692307692308) internal successors, (206), 189 states have internal predecessors, (206), 0 states have call successors, (0), 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:46:47,646 INFO L87 Difference]: Start difference. First operand 354 states. Second operand has 190 states, 104 states have (on average 1.9807692307692308) internal successors, (206), 189 states have internal predecessors, (206), 0 states have call successors, (0), 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:46:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:47,656 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2022-02-20 23:46:47,656 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 382 transitions. [2022-02-20 23:46:47,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:47,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:47,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 104 states have (on average 1.9807692307692308) internal successors, (206), 189 states have internal predecessors, (206), 0 states have call successors, (0), 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 354 states. [2022-02-20 23:46:47,658 INFO L87 Difference]: Start difference. First operand has 190 states, 104 states have (on average 1.9807692307692308) internal successors, (206), 189 states have internal predecessors, (206), 0 states have call successors, (0), 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 354 states. [2022-02-20 23:46:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:47,668 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2022-02-20 23:46:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 382 transitions. [2022-02-20 23:46:47,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:47,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:47,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:47,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 104 states have (on average 1.9807692307692308) internal successors, (206), 189 states have internal predecessors, (206), 0 states have call successors, (0), 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:46:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 206 transitions. [2022-02-20 23:46:47,674 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 206 transitions. Word has length 6 [2022-02-20 23:46:47,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:47,674 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 206 transitions. [2022-02-20 23:46:47,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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:46:47,674 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 206 transitions. [2022-02-20 23:46:47,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:46:47,675 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:47,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:47,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:46:47,675 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:46:47,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:47,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924364, now seen corresponding path program 1 times [2022-02-20 23:46:47,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:47,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777514889] [2022-02-20 23:46:47,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:47,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:47,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {3306#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(16, 2); {3306#true} is VALID [2022-02-20 23:46:47,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {3306#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {3306#true} is VALID [2022-02-20 23:46:47,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {3306#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {3306#true} is VALID [2022-02-20 23:46:47,771 INFO L290 TraceCheckUtils]: 3: Hoare triple {3306#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {3306#true} is VALID [2022-02-20 23:46:47,771 INFO L290 TraceCheckUtils]: 4: Hoare triple {3306#true} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {3308#(= (select |#valid| |ULTIMATE.start_main_#t~malloc4#1.base|) 1)} is VALID [2022-02-20 23:46:47,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {3308#(= (select |#valid| |ULTIMATE.start_main_#t~malloc4#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {3309#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} is VALID [2022-02-20 23:46:47,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {3309#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {3309#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} is VALID [2022-02-20 23:46:47,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {3309#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {3310#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} is VALID [2022-02-20 23:46:47,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {3310#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {3310#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} is VALID [2022-02-20 23:46:47,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {3310#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} assume !(1 == #valid[main_#t~mem5#1.base]); {3307#false} is VALID [2022-02-20 23:46:47,776 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:46:47,776 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:47,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777514889] [2022-02-20 23:46:47,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777514889] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:47,776 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:47,777 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:47,777 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509361795] [2022-02-20 23:46:47,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:47,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 23:46:47,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:47,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:46:47,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:47,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:47,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:47,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:47,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:47,788 INFO L87 Difference]: Start difference. First operand 190 states and 206 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:46:48,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:48,381 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2022-02-20 23:46:48,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:46:48,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 23:46:48,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:46:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2022-02-20 23:46:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:46:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2022-02-20 23:46:48,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 206 transitions. [2022-02-20 23:46:48,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:48,530 INFO L225 Difference]: With dead ends: 189 [2022-02-20 23:46:48,531 INFO L226 Difference]: Without dead ends: 189 [2022-02-20 23:46:48,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:46:48,532 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 5 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:48,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 508 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-02-20 23:46:48,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-02-20 23:46:48,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:48,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 104 states have (on average 1.9711538461538463) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 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:46:48,537 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 104 states have (on average 1.9711538461538463) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 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:46:48,538 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 104 states have (on average 1.9711538461538463) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 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:46:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:48,542 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2022-02-20 23:46:48,542 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2022-02-20 23:46:48,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:48,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:48,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 104 states have (on average 1.9711538461538463) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 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 189 states. [2022-02-20 23:46:48,543 INFO L87 Difference]: Start difference. First operand has 189 states, 104 states have (on average 1.9711538461538463) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 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 189 states. [2022-02-20 23:46:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:48,547 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2022-02-20 23:46:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2022-02-20 23:46:48,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:48,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:48,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:48,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 104 states have (on average 1.9711538461538463) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 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:46:48,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2022-02-20 23:46:48,553 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 10 [2022-02-20 23:46:48,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:48,553 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2022-02-20 23:46:48,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:46:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2022-02-20 23:46:48,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:46:48,554 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:48,554 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:48,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:46:48,554 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:46:48,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:48,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924365, now seen corresponding path program 1 times [2022-02-20 23:46:48,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:48,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722076925] [2022-02-20 23:46:48,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:48,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:48,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {4073#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(16, 2); {4073#true} is VALID [2022-02-20 23:46:48,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {4073#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {4073#true} is VALID [2022-02-20 23:46:48,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {4073#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {4073#true} is VALID [2022-02-20 23:46:48,670 INFO L290 TraceCheckUtils]: 3: Hoare triple {4073#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {4073#true} is VALID [2022-02-20 23:46:48,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {4073#true} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {4075#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) 4) (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0))} is VALID [2022-02-20 23:46:48,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {4075#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) 4) (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {4076#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} is VALID [2022-02-20 23:46:48,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {4076#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {4076#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} is VALID [2022-02-20 23:46:48,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {4076#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {4077#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) (- 4)) 0))} is VALID [2022-02-20 23:46:48,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {4077#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) (- 4)) 0))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {4077#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) (- 4)) 0))} is VALID [2022-02-20 23:46:48,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {4077#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) (- 4)) 0))} assume !(4 + main_#t~mem5#1.offset <= #length[main_#t~mem5#1.base] && 0 <= main_#t~mem5#1.offset); {4074#false} is VALID [2022-02-20 23:46:48,675 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:46:48,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:48,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722076925] [2022-02-20 23:46:48,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722076925] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:48,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:48,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:48,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151852768] [2022-02-20 23:46:48,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:48,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 23:46:48,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:48,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:46:48,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:48,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:48,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:48,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:48,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:48,686 INFO L87 Difference]: Start difference. First operand 189 states and 205 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:46:49,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:49,305 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2022-02-20 23:46:49,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:46:49,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 23:46:49,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:46:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 205 transitions. [2022-02-20 23:46:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:46:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 205 transitions. [2022-02-20 23:46:49,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 205 transitions. [2022-02-20 23:46:49,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:49,452 INFO L225 Difference]: With dead ends: 188 [2022-02-20 23:46:49,452 INFO L226 Difference]: Without dead ends: 188 [2022-02-20 23:46:49,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:46:49,453 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 3 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:49,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 529 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:49,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-02-20 23:46:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-02-20 23:46:49,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:49,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 188 states, 104 states have (on average 1.9615384615384615) internal successors, (204), 187 states have internal predecessors, (204), 0 states have call successors, (0), 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:46:49,458 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 188 states, 104 states have (on average 1.9615384615384615) internal successors, (204), 187 states have internal predecessors, (204), 0 states have call successors, (0), 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:46:49,458 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 188 states, 104 states have (on average 1.9615384615384615) internal successors, (204), 187 states have internal predecessors, (204), 0 states have call successors, (0), 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:46:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:49,462 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2022-02-20 23:46:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2022-02-20 23:46:49,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:49,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:49,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 104 states have (on average 1.9615384615384615) internal successors, (204), 187 states have internal predecessors, (204), 0 states have call successors, (0), 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 188 states. [2022-02-20 23:46:49,464 INFO L87 Difference]: Start difference. First operand has 188 states, 104 states have (on average 1.9615384615384615) internal successors, (204), 187 states have internal predecessors, (204), 0 states have call successors, (0), 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 188 states. [2022-02-20 23:46:49,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:49,469 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2022-02-20 23:46:49,469 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2022-02-20 23:46:49,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:49,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:49,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:49,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 104 states have (on average 1.9615384615384615) internal successors, (204), 187 states have internal predecessors, (204), 0 states have call successors, (0), 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:46:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2022-02-20 23:46:49,474 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 10 [2022-02-20 23:46:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:49,475 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2022-02-20 23:46:49,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:46:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2022-02-20 23:46:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:46:49,475 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:49,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:49,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:46:49,476 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:46:49,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596085, now seen corresponding path program 1 times [2022-02-20 23:46:49,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:49,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323510476] [2022-02-20 23:46:49,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:49,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:49,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {4836#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(16, 2); {4836#true} is VALID [2022-02-20 23:46:49,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {4836#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {4836#true} is VALID [2022-02-20 23:46:49,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {4836#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {4838#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:49,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {4838#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {4838#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:49,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {4838#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {4839#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc4#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:49,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {4839#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc4#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {4840#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:49,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {4840#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {4840#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:49,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {4840#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {4841#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1))} is VALID [2022-02-20 23:46:49,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {4841#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {4841#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1))} is VALID [2022-02-20 23:46:49,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {4841#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1))} SUMMARY for call write~$Pointer$(main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, 4); srcloc: L542-2 {4842#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} is VALID [2022-02-20 23:46:49,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {4842#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {4842#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} is VALID [2022-02-20 23:46:49,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {4842#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {4842#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} is VALID [2022-02-20 23:46:49,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {4842#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {4842#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} is VALID [2022-02-20 23:46:49,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {4842#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {4843#(= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)} is VALID [2022-02-20 23:46:49,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {4843#(= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)} assume !(1 == #valid[main_#t~mem9#1.base]); {4837#false} is VALID [2022-02-20 23:46:49,597 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:46:49,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:49,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323510476] [2022-02-20 23:46:49,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323510476] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:49,598 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:49,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:46:49,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188350024] [2022-02-20 23:46:49,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:49,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:46:49,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:49,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:49,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:49,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:46:49,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:49,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:46:49,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:46:49,613 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,217 INFO L93 Difference]: Finished difference Result 353 states and 389 transitions. [2022-02-20 23:46:51,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:46:51,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:46:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 390 transitions. [2022-02-20 23:46:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 390 transitions. [2022-02-20 23:46:51,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 390 transitions. [2022-02-20 23:46:51,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:51,497 INFO L225 Difference]: With dead ends: 353 [2022-02-20 23:46:51,498 INFO L226 Difference]: Without dead ends: 353 [2022-02-20 23:46:51,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:46:51,499 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 378 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:51,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 795 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:46:51,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-02-20 23:46:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 192. [2022-02-20 23:46:51,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:51,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 192 states, 108 states have (on average 1.9444444444444444) internal successors, (210), 191 states have internal predecessors, (210), 0 states have call successors, (0), 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:46:51,505 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 192 states, 108 states have (on average 1.9444444444444444) internal successors, (210), 191 states have internal predecessors, (210), 0 states have call successors, (0), 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:46:51,505 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 192 states, 108 states have (on average 1.9444444444444444) internal successors, (210), 191 states have internal predecessors, (210), 0 states have call successors, (0), 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:46:51,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,513 INFO L93 Difference]: Finished difference Result 353 states and 389 transitions. [2022-02-20 23:46:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 389 transitions. [2022-02-20 23:46:51,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:51,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:51,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 192 states, 108 states have (on average 1.9444444444444444) internal successors, (210), 191 states have internal predecessors, (210), 0 states have call successors, (0), 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 353 states. [2022-02-20 23:46:51,515 INFO L87 Difference]: Start difference. First operand has 192 states, 108 states have (on average 1.9444444444444444) internal successors, (210), 191 states have internal predecessors, (210), 0 states have call successors, (0), 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 353 states. [2022-02-20 23:46:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,522 INFO L93 Difference]: Finished difference Result 353 states and 389 transitions. [2022-02-20 23:46:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 389 transitions. [2022-02-20 23:46:51,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:51,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:51,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:51,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.9444444444444444) internal successors, (210), 191 states have internal predecessors, (210), 0 states have call successors, (0), 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:46:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2022-02-20 23:46:51,527 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 15 [2022-02-20 23:46:51,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:51,528 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2022-02-20 23:46:51,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2022-02-20 23:46:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:46:51,528 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:51,528 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:51,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:46:51,529 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:46:51,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:51,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596086, now seen corresponding path program 1 times [2022-02-20 23:46:51,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:51,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411575581] [2022-02-20 23:46:51,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:51,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:51,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {6109#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(16, 2); {6109#true} is VALID [2022-02-20 23:46:51,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {6109#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {6109#true} is VALID [2022-02-20 23:46:51,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {6109#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {6111#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:51,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {6111#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {6111#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:51,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {6111#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {6112#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) 4) (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:51,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {6112#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) 4) (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {6113#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:51,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {6113#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {6113#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:51,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {6113#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {6114#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} is VALID [2022-02-20 23:46:51,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {6114#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {6114#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} is VALID [2022-02-20 23:46:51,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {6114#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} SUMMARY for call write~$Pointer$(main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, 4); srcloc: L542-2 {6115#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} is VALID [2022-02-20 23:46:51,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {6115#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {6115#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} is VALID [2022-02-20 23:46:51,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {6115#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {6115#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} is VALID [2022-02-20 23:46:51,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {6115#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {6115#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} is VALID [2022-02-20 23:46:51,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {6115#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {6116#(and (= (+ (- 4) (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)) 0) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} is VALID [2022-02-20 23:46:51,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {6116#(and (= (+ (- 4) (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)) 0) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} assume !(4 + main_#t~mem9#1.offset <= #length[main_#t~mem9#1.base] && 0 <= main_#t~mem9#1.offset); {6110#false} is VALID [2022-02-20 23:46:51,766 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:46:51,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:51,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411575581] [2022-02-20 23:46:51,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411575581] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:51,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:51,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:46:51,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691178752] [2022-02-20 23:46:51,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:51,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:46:51,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:51,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:51,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:46:51,783 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:51,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:46:51,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:46:51,784 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,640 INFO L93 Difference]: Finished difference Result 347 states and 383 transitions. [2022-02-20 23:46:53,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:46:53,640 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:46:53,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 384 transitions. [2022-02-20 23:46:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 384 transitions. [2022-02-20 23:46:53,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 384 transitions. [2022-02-20 23:46:53,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:53,954 INFO L225 Difference]: With dead ends: 347 [2022-02-20 23:46:53,954 INFO L226 Difference]: Without dead ends: 347 [2022-02-20 23:46:53,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:46:53,956 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 365 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:53,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 630 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 23:46:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-02-20 23:46:53,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 192. [2022-02-20 23:46:53,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:53,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 347 states. Second operand has 192 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 191 states have internal predecessors, (209), 0 states have call successors, (0), 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:46:53,960 INFO L74 IsIncluded]: Start isIncluded. First operand 347 states. Second operand has 192 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 191 states have internal predecessors, (209), 0 states have call successors, (0), 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:46:53,961 INFO L87 Difference]: Start difference. First operand 347 states. Second operand has 192 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 191 states have internal predecessors, (209), 0 states have call successors, (0), 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:46:53,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,968 INFO L93 Difference]: Finished difference Result 347 states and 383 transitions. [2022-02-20 23:46:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 383 transitions. [2022-02-20 23:46:53,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:53,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:53,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 192 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 191 states have internal predecessors, (209), 0 states have call successors, (0), 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 347 states. [2022-02-20 23:46:53,970 INFO L87 Difference]: Start difference. First operand has 192 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 191 states have internal predecessors, (209), 0 states have call successors, (0), 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 347 states. [2022-02-20 23:46:53,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,977 INFO L93 Difference]: Finished difference Result 347 states and 383 transitions. [2022-02-20 23:46:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 383 transitions. [2022-02-20 23:46:53,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:53,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:53,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:53,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:53,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 191 states have internal predecessors, (209), 0 states have call successors, (0), 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:46:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2022-02-20 23:46:53,982 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 15 [2022-02-20 23:46:53,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:53,982 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2022-02-20 23:46:53,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2022-02-20 23:46:53,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:46:53,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:53,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:53,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:46:53,984 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:46:53,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:53,984 INFO L85 PathProgramCache]: Analyzing trace with hash 192740277, now seen corresponding path program 1 times [2022-02-20 23:46:53,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:53,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939240360] [2022-02-20 23:46:53,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:53,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:54,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {7364#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(16, 2); {7364#true} is VALID [2022-02-20 23:46:54,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {7364#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {7364#true} is VALID [2022-02-20 23:46:54,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {7364#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {7364#true} is VALID [2022-02-20 23:46:54,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {7364#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {7364#true} is VALID [2022-02-20 23:46:54,025 INFO L290 TraceCheckUtils]: 4: Hoare triple {7364#true} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {7364#true} is VALID [2022-02-20 23:46:54,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {7364#true} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {7364#true} is VALID [2022-02-20 23:46:54,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {7364#true} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {7364#true} is VALID [2022-02-20 23:46:54,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {7364#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {7364#true} is VALID [2022-02-20 23:46:54,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {7364#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {7364#true} is VALID [2022-02-20 23:46:54,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {7364#true} SUMMARY for call write~$Pointer$(main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, 4); srcloc: L542-2 {7364#true} is VALID [2022-02-20 23:46:54,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {7364#true} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {7364#true} is VALID [2022-02-20 23:46:54,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {7364#true} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {7364#true} is VALID [2022-02-20 23:46:54,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {7364#true} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {7366#(= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|))} is VALID [2022-02-20 23:46:54,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {7366#(= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {7366#(= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|))} is VALID [2022-02-20 23:46:54,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {7366#(= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_#t~mem9#1.base, main_#t~mem9#1.offset, 4); srcloc: L546-1 {7366#(= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|))} is VALID [2022-02-20 23:46:54,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {7366#(= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|))} assume !(1 == #valid[main_~tmpList~0#1.base]); {7365#false} is VALID [2022-02-20 23:46:54,029 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:46:54,030 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:54,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939240360] [2022-02-20 23:46:54,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939240360] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:54,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:54,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:54,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952620107] [2022-02-20 23:46:54,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:54,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:46:54,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:54,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:46:54,043 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:46:54,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:54,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:54,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:54,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:54,044 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:46:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,417 INFO L93 Difference]: Finished difference Result 316 states and 348 transitions. [2022-02-20 23:46:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:54,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:46:54,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:46:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2022-02-20 23:46:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:46:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2022-02-20 23:46:54,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 349 transitions. [2022-02-20 23:46:54,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:54,689 INFO L225 Difference]: With dead ends: 316 [2022-02-20 23:46:54,689 INFO L226 Difference]: Without dead ends: 316 [2022-02-20 23:46:54,689 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:46:54,690 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 168 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:54,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 348 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:54,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-02-20 23:46:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 189. [2022-02-20 23:46:54,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:54,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand has 189 states, 108 states have (on average 1.9074074074074074) internal successors, (206), 188 states have internal predecessors, (206), 0 states have call successors, (0), 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:46:54,695 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand has 189 states, 108 states have (on average 1.9074074074074074) internal successors, (206), 188 states have internal predecessors, (206), 0 states have call successors, (0), 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:46:54,703 INFO L87 Difference]: Start difference. First operand 316 states. Second operand has 189 states, 108 states have (on average 1.9074074074074074) internal successors, (206), 188 states have internal predecessors, (206), 0 states have call successors, (0), 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:46:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,709 INFO L93 Difference]: Finished difference Result 316 states and 348 transitions. [2022-02-20 23:46:54,709 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 348 transitions. [2022-02-20 23:46:54,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:54,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:54,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 108 states have (on average 1.9074074074074074) internal successors, (206), 188 states have internal predecessors, (206), 0 states have call successors, (0), 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 316 states. [2022-02-20 23:46:54,711 INFO L87 Difference]: Start difference. First operand has 189 states, 108 states have (on average 1.9074074074074074) internal successors, (206), 188 states have internal predecessors, (206), 0 states have call successors, (0), 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 316 states. [2022-02-20 23:46:54,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,717 INFO L93 Difference]: Finished difference Result 316 states and 348 transitions. [2022-02-20 23:46:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 348 transitions. [2022-02-20 23:46:54,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:54,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:54,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:54,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 108 states have (on average 1.9074074074074074) internal successors, (206), 188 states have internal predecessors, (206), 0 states have call successors, (0), 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:46:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2022-02-20 23:46:54,721 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 16 [2022-02-20 23:46:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:54,722 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2022-02-20 23:46:54,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:46:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2022-02-20 23:46:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:46:54,722 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:54,723 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:54,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:46:54,725 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:46:54,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:54,726 INFO L85 PathProgramCache]: Analyzing trace with hash 192740278, now seen corresponding path program 1 times [2022-02-20 23:46:54,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:54,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333889995] [2022-02-20 23:46:54,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:54,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:54,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {8506#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(16, 2); {8506#true} is VALID [2022-02-20 23:46:54,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {8506#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {8506#true} is VALID [2022-02-20 23:46:54,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {8506#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {8506#true} is VALID [2022-02-20 23:46:54,812 INFO L290 TraceCheckUtils]: 3: Hoare triple {8506#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {8506#true} is VALID [2022-02-20 23:46:54,812 INFO L290 TraceCheckUtils]: 4: Hoare triple {8506#true} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {8506#true} is VALID [2022-02-20 23:46:54,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {8506#true} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {8506#true} is VALID [2022-02-20 23:46:54,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {8506#true} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {8506#true} is VALID [2022-02-20 23:46:54,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {8506#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {8506#true} is VALID [2022-02-20 23:46:54,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {8506#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {8506#true} is VALID [2022-02-20 23:46:54,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {8506#true} SUMMARY for call write~$Pointer$(main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, 4); srcloc: L542-2 {8506#true} is VALID [2022-02-20 23:46:54,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {8506#true} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {8506#true} is VALID [2022-02-20 23:46:54,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {8506#true} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {8506#true} is VALID [2022-02-20 23:46:54,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {8506#true} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {8508#(and (= |ULTIMATE.start_main_~tmpList~0#1.offset| 0) (= (+ (- 4) (select |#length| |ULTIMATE.start_main_~tmpList~0#1.base|)) 0))} is VALID [2022-02-20 23:46:54,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {8508#(and (= |ULTIMATE.start_main_~tmpList~0#1.offset| 0) (= (+ (- 4) (select |#length| |ULTIMATE.start_main_~tmpList~0#1.base|)) 0))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {8508#(and (= |ULTIMATE.start_main_~tmpList~0#1.offset| 0) (= (+ (- 4) (select |#length| |ULTIMATE.start_main_~tmpList~0#1.base|)) 0))} is VALID [2022-02-20 23:46:54,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {8508#(and (= |ULTIMATE.start_main_~tmpList~0#1.offset| 0) (= (+ (- 4) (select |#length| |ULTIMATE.start_main_~tmpList~0#1.base|)) 0))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_#t~mem9#1.base, main_#t~mem9#1.offset, 4); srcloc: L546-1 {8508#(and (= |ULTIMATE.start_main_~tmpList~0#1.offset| 0) (= (+ (- 4) (select |#length| |ULTIMATE.start_main_~tmpList~0#1.base|)) 0))} is VALID [2022-02-20 23:46:54,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {8508#(and (= |ULTIMATE.start_main_~tmpList~0#1.offset| 0) (= (+ (- 4) (select |#length| |ULTIMATE.start_main_~tmpList~0#1.base|)) 0))} assume !(4 + main_~tmpList~0#1.offset <= #length[main_~tmpList~0#1.base] && 0 <= main_~tmpList~0#1.offset); {8507#false} is VALID [2022-02-20 23:46:54,816 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:46:54,816 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:54,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333889995] [2022-02-20 23:46:54,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333889995] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:54,817 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:54,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:54,817 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448912097] [2022-02-20 23:46:54,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:54,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:46:54,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:54,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:46:54,830 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:46:54,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:54,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:54,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:54,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:54,831 INFO L87 Difference]: Start difference. First operand 189 states and 206 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:46:55,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:55,205 INFO L93 Difference]: Finished difference Result 293 states and 325 transitions. [2022-02-20 23:46:55,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:55,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:46:55,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:55,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:46:55,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2022-02-20 23:46:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:46:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2022-02-20 23:46:55,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 325 transitions. [2022-02-20 23:46:55,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:55,475 INFO L225 Difference]: With dead ends: 293 [2022-02-20 23:46:55,475 INFO L226 Difference]: Without dead ends: 293 [2022-02-20 23:46:55,475 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:46:55,478 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 139 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:55,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 359 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:55,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-02-20 23:46:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 187. [2022-02-20 23:46:55,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:55,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 293 states. Second operand has 187 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 186 states have internal predecessors, (204), 0 states have call successors, (0), 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:46:55,485 INFO L74 IsIncluded]: Start isIncluded. First operand 293 states. Second operand has 187 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 186 states have internal predecessors, (204), 0 states have call successors, (0), 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:46:55,485 INFO L87 Difference]: Start difference. First operand 293 states. Second operand has 187 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 186 states have internal predecessors, (204), 0 states have call successors, (0), 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:46:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:55,490 INFO L93 Difference]: Finished difference Result 293 states and 325 transitions. [2022-02-20 23:46:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 325 transitions. [2022-02-20 23:46:55,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:55,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:55,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 186 states have internal predecessors, (204), 0 states have call successors, (0), 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 293 states. [2022-02-20 23:46:55,492 INFO L87 Difference]: Start difference. First operand has 187 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 186 states have internal predecessors, (204), 0 states have call successors, (0), 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 293 states. [2022-02-20 23:46:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:55,498 INFO L93 Difference]: Finished difference Result 293 states and 325 transitions. [2022-02-20 23:46:55,498 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 325 transitions. [2022-02-20 23:46:55,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:55,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:55,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:55,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 186 states have internal predecessors, (204), 0 states have call successors, (0), 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:46:55,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2022-02-20 23:46:55,502 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 16 [2022-02-20 23:46:55,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:55,503 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2022-02-20 23:46:55,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:46:55,503 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2022-02-20 23:46:55,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:46:55,503 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:55,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:55,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:46:55,504 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:46:55,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:55,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809590, now seen corresponding path program 1 times [2022-02-20 23:46:55,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:55,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073868845] [2022-02-20 23:46:55,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:55,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:55,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {9577#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(16, 2); {9577#true} is VALID [2022-02-20 23:46:55,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {9577#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {9577#true} is VALID [2022-02-20 23:46:55,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {9577#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {9577#true} is VALID [2022-02-20 23:46:55,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {9577#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {9577#true} is VALID [2022-02-20 23:46:55,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {9577#true} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {9577#true} is VALID [2022-02-20 23:46:55,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {9577#true} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:55,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:55,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:55,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:55,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, 4); srcloc: L542-2 {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:55,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:55,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:55,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1; {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:55,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} goto; {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:55,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647; {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:55,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {9579#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} assume !!(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1;main_~tmp~0#1.base, main_~tmp~0#1.offset := main_~tree~0#1.base, main_~tree~0#1.offset; {9580#(= (select |#valid| |ULTIMATE.start_main_~tmp~0#1.base|) 1)} is VALID [2022-02-20 23:46:55,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {9580#(= (select |#valid| |ULTIMATE.start_main_~tmp~0#1.base|) 1)} assume !(1 == #valid[main_~tmp~0#1.base]); {9578#false} is VALID [2022-02-20 23:46:55,585 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:46:55,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:55,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073868845] [2022-02-20 23:46:55,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073868845] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:55,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:55,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:55,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193409983] [2022-02-20 23:46:55,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:55,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:46:55,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:55,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:55,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:46:55,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:55,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:46:55,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:46:55,600 INFO L87 Difference]: Start difference. First operand 187 states and 204 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:56,002 INFO L93 Difference]: Finished difference Result 254 states and 278 transitions. [2022-02-20 23:46:56,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:46:56,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:46:56,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 300 transitions. [2022-02-20 23:46:56,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 300 transitions. [2022-02-20 23:46:56,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 300 transitions. [2022-02-20 23:46:56,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:56,260 INFO L225 Difference]: With dead ends: 254 [2022-02-20 23:46:56,260 INFO L226 Difference]: Without dead ends: 254 [2022-02-20 23:46:56,261 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:46:56,261 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 327 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:56,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 153 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-02-20 23:46:56,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 176. [2022-02-20 23:46:56,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:56,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 176 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 175 states have internal predecessors, (197), 0 states have call successors, (0), 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:46:56,265 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 176 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 175 states have internal predecessors, (197), 0 states have call successors, (0), 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:46:56,265 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 176 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 175 states have internal predecessors, (197), 0 states have call successors, (0), 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:46:56,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:56,272 INFO L93 Difference]: Finished difference Result 254 states and 278 transitions. [2022-02-20 23:46:56,273 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 278 transitions. [2022-02-20 23:46:56,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:56,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:56,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 176 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 175 states have internal predecessors, (197), 0 states have call successors, (0), 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 254 states. [2022-02-20 23:46:56,274 INFO L87 Difference]: Start difference. First operand has 176 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 175 states have internal predecessors, (197), 0 states have call successors, (0), 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 254 states. [2022-02-20 23:46:56,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:56,279 INFO L93 Difference]: Finished difference Result 254 states and 278 transitions. [2022-02-20 23:46:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 278 transitions. [2022-02-20 23:46:56,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:56,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:56,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:56,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 175 states have internal predecessors, (197), 0 states have call successors, (0), 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:46:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2022-02-20 23:46:56,283 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 17 [2022-02-20 23:46:56,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:56,283 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2022-02-20 23:46:56,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2022-02-20 23:46:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:46:56,284 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:56,285 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:56,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:46:56,285 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:46:56,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:56,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809591, now seen corresponding path program 1 times [2022-02-20 23:46:56,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:56,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890174691] [2022-02-20 23:46:56,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:56,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:56,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {10523#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(16, 2); {10523#true} is VALID [2022-02-20 23:46:56,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {10523#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {10525#(= |ULTIMATE.start_main_~tree~0#1.offset| 0)} is VALID [2022-02-20 23:46:56,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {10525#(= |ULTIMATE.start_main_~tree~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {10525#(= |ULTIMATE.start_main_~tree~0#1.offset| 0)} is VALID [2022-02-20 23:46:56,381 INFO L290 TraceCheckUtils]: 3: Hoare triple {10525#(= |ULTIMATE.start_main_~tree~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {10525#(= |ULTIMATE.start_main_~tree~0#1.offset| 0)} is VALID [2022-02-20 23:46:56,382 INFO L290 TraceCheckUtils]: 4: Hoare triple {10525#(= |ULTIMATE.start_main_~tree~0#1.offset| 0)} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {10525#(= |ULTIMATE.start_main_~tree~0#1.offset| 0)} is VALID [2022-02-20 23:46:56,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {10525#(= |ULTIMATE.start_main_~tree~0#1.offset| 0)} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:56,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:56,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:56,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:56,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, 4); srcloc: L542-2 {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:56,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:56,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:56,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1; {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:56,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} goto; {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:56,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647; {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:46:56,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {10526#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)))} assume !!(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1;main_~tmp~0#1.base, main_~tmp~0#1.offset := main_~tree~0#1.base, main_~tree~0#1.offset; {10527#(and (= |ULTIMATE.start_main_~tmp~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~tmp~0#1.base|)))} is VALID [2022-02-20 23:46:56,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {10527#(and (= |ULTIMATE.start_main_~tmp~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~tmp~0#1.base|)))} assume !(4 + main_~tmp~0#1.offset <= #length[main_~tmp~0#1.base] && 0 <= main_~tmp~0#1.offset); {10524#false} is VALID [2022-02-20 23:46:56,407 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:46:56,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:56,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890174691] [2022-02-20 23:46:56,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890174691] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:56,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:56,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:56,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307110127] [2022-02-20 23:46:56,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:56,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:46:56,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:56,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:56,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:56,425 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:56,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:56,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:56,426 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:57,255 INFO L93 Difference]: Finished difference Result 438 states and 492 transitions. [2022-02-20 23:46:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:46:57,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:46:57,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 495 transitions. [2022-02-20 23:46:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 495 transitions. [2022-02-20 23:46:57,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 495 transitions. [2022-02-20 23:46:57,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:57,660 INFO L225 Difference]: With dead ends: 438 [2022-02-20 23:46:57,660 INFO L226 Difference]: Without dead ends: 438 [2022-02-20 23:46:57,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:46:57,661 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 712 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:57,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [712 Valid, 293 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:46:57,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-02-20 23:46:57,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 318. [2022-02-20 23:46:57,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:57,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 438 states. Second operand has 318 states, 254 states have (on average 1.7598425196850394) internal successors, (447), 317 states have internal predecessors, (447), 0 states have call successors, (0), 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:46:57,668 INFO L74 IsIncluded]: Start isIncluded. First operand 438 states. Second operand has 318 states, 254 states have (on average 1.7598425196850394) internal successors, (447), 317 states have internal predecessors, (447), 0 states have call successors, (0), 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:46:57,669 INFO L87 Difference]: Start difference. First operand 438 states. Second operand has 318 states, 254 states have (on average 1.7598425196850394) internal successors, (447), 317 states have internal predecessors, (447), 0 states have call successors, (0), 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:46:57,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:57,679 INFO L93 Difference]: Finished difference Result 438 states and 492 transitions. [2022-02-20 23:46:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 492 transitions. [2022-02-20 23:46:57,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:57,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:57,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 318 states, 254 states have (on average 1.7598425196850394) internal successors, (447), 317 states have internal predecessors, (447), 0 states have call successors, (0), 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 438 states. [2022-02-20 23:46:57,682 INFO L87 Difference]: Start difference. First operand has 318 states, 254 states have (on average 1.7598425196850394) internal successors, (447), 317 states have internal predecessors, (447), 0 states have call successors, (0), 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 438 states. [2022-02-20 23:46:57,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:57,692 INFO L93 Difference]: Finished difference Result 438 states and 492 transitions. [2022-02-20 23:46:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 492 transitions. [2022-02-20 23:46:57,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:57,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:57,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:57,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:57,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 254 states have (on average 1.7598425196850394) internal successors, (447), 317 states have internal predecessors, (447), 0 states have call successors, (0), 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:46:57,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 447 transitions. [2022-02-20 23:46:57,700 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 447 transitions. Word has length 17 [2022-02-20 23:46:57,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:57,700 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 447 transitions. [2022-02-20 23:46:57,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,701 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 447 transitions. [2022-02-20 23:46:57,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:46:57,701 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:57,701 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:57,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:46:57,702 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:46:57,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:57,702 INFO L85 PathProgramCache]: Analyzing trace with hash -445669701, now seen corresponding path program 1 times [2022-02-20 23:46:57,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:57,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636951418] [2022-02-20 23:46:57,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:57,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:57,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {12166#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(16, 2); {12166#true} is VALID [2022-02-20 23:46:57,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {12166#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {12166#true} is VALID [2022-02-20 23:46:57,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {12166#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {12166#true} is VALID [2022-02-20 23:46:57,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {12166#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {12166#true} is VALID [2022-02-20 23:46:57,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {12166#true} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {12166#true} is VALID [2022-02-20 23:46:57,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {12166#true} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {12168#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:57,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {12168#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {12168#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:57,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {12168#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {12168#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:57,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {12168#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {12168#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:57,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {12168#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, 4); srcloc: L542-2 {12168#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:57,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {12168#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {12168#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:57,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {12168#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {12168#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:46:57,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {12168#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {12169#(not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|))} is VALID [2022-02-20 23:46:57,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {12169#(not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {12170#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)))} is VALID [2022-02-20 23:46:57,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {12170#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_#t~mem9#1.base, main_#t~mem9#1.offset, 4); srcloc: L546-1 {12171#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1))} is VALID [2022-02-20 23:46:57,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {12171#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1))} SUMMARY for call write~$Pointer$(main_#t~mem10#1.base, main_#t~mem10#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset, 4); srcloc: L546-2 {12172#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} is VALID [2022-02-20 23:46:57,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {12172#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {12172#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} is VALID [2022-02-20 23:46:57,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {12172#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L547 {12173#(= (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|) 1)} is VALID [2022-02-20 23:46:57,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {12173#(= (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|) 1)} assume !(1 == #valid[main_#t~mem11#1.base]); {12167#false} is VALID [2022-02-20 23:46:57,792 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:46:57,792 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:57,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636951418] [2022-02-20 23:46:57,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636951418] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:57,793 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:57,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:46:57,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669173069] [2022-02-20 23:46:57,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:57,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:46:57,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:57,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:57,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:46:57,810 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:57,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:46:57,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:46:57,811 INFO L87 Difference]: Start difference. First operand 318 states and 447 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:59,624 INFO L93 Difference]: Finished difference Result 784 states and 1126 transitions. [2022-02-20 23:46:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:46:59,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:46:59,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 456 transitions. [2022-02-20 23:46:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 456 transitions. [2022-02-20 23:46:59,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 456 transitions. [2022-02-20 23:46:59,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:59,955 INFO L225 Difference]: With dead ends: 784 [2022-02-20 23:46:59,956 INFO L226 Difference]: Without dead ends: 784 [2022-02-20 23:46:59,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:46:59,956 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 363 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:59,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 1218 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:46:59,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-02-20 23:46:59,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 317. [2022-02-20 23:46:59,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:59,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 784 states. Second operand has 317 states, 254 states have (on average 1.7559055118110236) internal successors, (446), 316 states have internal predecessors, (446), 0 states have call successors, (0), 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:46:59,965 INFO L74 IsIncluded]: Start isIncluded. First operand 784 states. Second operand has 317 states, 254 states have (on average 1.7559055118110236) internal successors, (446), 316 states have internal predecessors, (446), 0 states have call successors, (0), 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:46:59,965 INFO L87 Difference]: Start difference. First operand 784 states. Second operand has 317 states, 254 states have (on average 1.7559055118110236) internal successors, (446), 316 states have internal predecessors, (446), 0 states have call successors, (0), 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:46:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:59,994 INFO L93 Difference]: Finished difference Result 784 states and 1126 transitions. [2022-02-20 23:46:59,994 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1126 transitions. [2022-02-20 23:46:59,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:59,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:59,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 317 states, 254 states have (on average 1.7559055118110236) internal successors, (446), 316 states have internal predecessors, (446), 0 states have call successors, (0), 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 784 states. [2022-02-20 23:46:59,997 INFO L87 Difference]: Start difference. First operand has 317 states, 254 states have (on average 1.7559055118110236) internal successors, (446), 316 states have internal predecessors, (446), 0 states have call successors, (0), 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 784 states. [2022-02-20 23:47:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:00,027 INFO L93 Difference]: Finished difference Result 784 states and 1126 transitions. [2022-02-20 23:47:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1126 transitions. [2022-02-20 23:47:00,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:00,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:00,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:00,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:00,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 254 states have (on average 1.7559055118110236) internal successors, (446), 316 states have internal predecessors, (446), 0 states have call successors, (0), 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:47:00,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 446 transitions. [2022-02-20 23:47:00,035 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 446 transitions. Word has length 19 [2022-02-20 23:47:00,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:00,035 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 446 transitions. [2022-02-20 23:47:00,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,036 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 446 transitions. [2022-02-20 23:47:00,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:47:00,036 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:00,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:00,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:47:00,036 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:47:00,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:00,037 INFO L85 PathProgramCache]: Analyzing trace with hash -445669700, now seen corresponding path program 1 times [2022-02-20 23:47:00,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:00,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306341347] [2022-02-20 23:47:00,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:00,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:00,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {14857#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(16, 2); {14857#true} is VALID [2022-02-20 23:47:00,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {14857#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {14857#true} is VALID [2022-02-20 23:47:00,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {14857#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {14859#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {14859#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {14859#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,220 INFO L290 TraceCheckUtils]: 4: Hoare triple {14859#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {14860#(and (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:00,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {14860#(and (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {14861#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:00,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {14861#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {14861#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:00,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {14861#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {14862#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} is VALID [2022-02-20 23:47:00,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {14862#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {14862#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} is VALID [2022-02-20 23:47:00,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {14862#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} SUMMARY for call write~$Pointer$(main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, 4); srcloc: L542-2 {14863#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} is VALID [2022-02-20 23:47:00,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {14863#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {14863#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} is VALID [2022-02-20 23:47:00,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {14863#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {14863#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} is VALID [2022-02-20 23:47:00,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {14863#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {14864#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} is VALID [2022-02-20 23:47:00,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {14864#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {14865#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} is VALID [2022-02-20 23:47:00,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {14865#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_#t~mem9#1.base, main_#t~mem9#1.offset, 4); srcloc: L546-1 {14866#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} is VALID [2022-02-20 23:47:00,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {14866#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} SUMMARY for call write~$Pointer$(main_#t~mem10#1.base, main_#t~mem10#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset, 4); srcloc: L546-2 {14867#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} is VALID [2022-02-20 23:47:00,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {14867#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {14867#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} is VALID [2022-02-20 23:47:00,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {14867#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L547 {14868#(and (= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_#t~mem11#1.base|)))} is VALID [2022-02-20 23:47:00,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {14868#(and (= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_#t~mem11#1.base|)))} assume !(4 + main_#t~mem11#1.offset <= #length[main_#t~mem11#1.base] && 0 <= main_#t~mem11#1.offset); {14858#false} is VALID [2022-02-20 23:47:00,229 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:47:00,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:00,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306341347] [2022-02-20 23:47:00,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306341347] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:00,230 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:00,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 23:47:00,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15560419] [2022-02-20 23:47:00,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:00,231 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:47:00,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:00,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:00,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:47:00,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:00,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:47:00,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:47:00,254 INFO L87 Difference]: Start difference. First operand 317 states and 446 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:02,066 INFO L93 Difference]: Finished difference Result 603 states and 842 transitions. [2022-02-20 23:47:02,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:47:02,067 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:47:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 380 transitions. [2022-02-20 23:47:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 380 transitions. [2022-02-20 23:47:02,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 380 transitions. [2022-02-20 23:47:02,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:02,406 INFO L225 Difference]: With dead ends: 603 [2022-02-20 23:47:02,406 INFO L226 Difference]: Without dead ends: 603 [2022-02-20 23:47:02,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:47:02,407 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 389 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:02,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 1020 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:47:02,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-02-20 23:47:02,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 321. [2022-02-20 23:47:02,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:02,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 321 states, 258 states have (on average 1.744186046511628) internal successors, (450), 320 states have internal predecessors, (450), 0 states have call successors, (0), 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:47:02,414 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 321 states, 258 states have (on average 1.744186046511628) internal successors, (450), 320 states have internal predecessors, (450), 0 states have call successors, (0), 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:47:02,415 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 321 states, 258 states have (on average 1.744186046511628) internal successors, (450), 320 states have internal predecessors, (450), 0 states have call successors, (0), 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:47:02,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:02,431 INFO L93 Difference]: Finished difference Result 603 states and 842 transitions. [2022-02-20 23:47:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 842 transitions. [2022-02-20 23:47:02,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:02,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:02,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 321 states, 258 states have (on average 1.744186046511628) internal successors, (450), 320 states have internal predecessors, (450), 0 states have call successors, (0), 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 603 states. [2022-02-20 23:47:02,434 INFO L87 Difference]: Start difference. First operand has 321 states, 258 states have (on average 1.744186046511628) internal successors, (450), 320 states have internal predecessors, (450), 0 states have call successors, (0), 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 603 states. [2022-02-20 23:47:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:02,451 INFO L93 Difference]: Finished difference Result 603 states and 842 transitions. [2022-02-20 23:47:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 842 transitions. [2022-02-20 23:47:02,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:02,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:02,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:02,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 258 states have (on average 1.744186046511628) internal successors, (450), 320 states have internal predecessors, (450), 0 states have call successors, (0), 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:47:02,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 450 transitions. [2022-02-20 23:47:02,459 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 450 transitions. Word has length 19 [2022-02-20 23:47:02,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:02,459 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 450 transitions. [2022-02-20 23:47:02,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 450 transitions. [2022-02-20 23:47:02,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:47:02,460 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:02,460 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:02,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:47:02,461 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:47:02,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:02,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1571609538, now seen corresponding path program 1 times [2022-02-20 23:47:02,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:02,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933624141] [2022-02-20 23:47:02,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:02,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:02,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {17021#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(16, 2); {17021#true} is VALID [2022-02-20 23:47:02,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {17021#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} is VALID [2022-02-20 23:47:02,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} is VALID [2022-02-20 23:47:02,500 INFO L290 TraceCheckUtils]: 3: Hoare triple {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} is VALID [2022-02-20 23:47:02,500 INFO L290 TraceCheckUtils]: 4: Hoare triple {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} is VALID [2022-02-20 23:47:02,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} is VALID [2022-02-20 23:47:02,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} is VALID [2022-02-20 23:47:02,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} is VALID [2022-02-20 23:47:02,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} is VALID [2022-02-20 23:47:02,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, 4); srcloc: L542-2 {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} is VALID [2022-02-20 23:47:02,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} is VALID [2022-02-20 23:47:02,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} is VALID [2022-02-20 23:47:02,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1; {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} is VALID [2022-02-20 23:47:02,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} goto; {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} is VALID [2022-02-20 23:47:02,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647; {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} is VALID [2022-02-20 23:47:02,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1; {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} is VALID [2022-02-20 23:47:02,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {17023#(not (= |ULTIMATE.start_main_~tree~0#1.base| 0))} assume !(0 != main_~tree~0#1.base || 0 != main_~tree~0#1.offset); {17022#false} is VALID [2022-02-20 23:47:02,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {17022#false} main_#res#1 := 0; {17022#false} is VALID [2022-02-20 23:47:02,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {17022#false} assume !(#valid == main_old_#valid#1); {17022#false} is VALID [2022-02-20 23:47:02,510 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:47:02,510 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:02,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933624141] [2022-02-20 23:47:02,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933624141] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:02,510 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:02,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:02,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399307906] [2022-02-20 23:47:02,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:02,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:47:02,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:02,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:02,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:02,526 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:02,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:02,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:02,527 INFO L87 Difference]: Start difference. First operand 321 states and 450 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:02,706 INFO L93 Difference]: Finished difference Result 395 states and 528 transitions. [2022-02-20 23:47:02,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:02,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:47:02,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2022-02-20 23:47:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2022-02-20 23:47:02,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 263 transitions. [2022-02-20 23:47:02,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:02,879 INFO L225 Difference]: With dead ends: 395 [2022-02-20 23:47:02,879 INFO L226 Difference]: Without dead ends: 395 [2022-02-20 23:47:02,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:47:02,880 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 163 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:02,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 296 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:02,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-02-20 23:47:02,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 361. [2022-02-20 23:47:02,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:02,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 395 states. Second operand has 361 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 360 states have internal predecessors, (528), 0 states have call successors, (0), 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:47:02,886 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand has 361 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 360 states have internal predecessors, (528), 0 states have call successors, (0), 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:47:02,887 INFO L87 Difference]: Start difference. First operand 395 states. Second operand has 361 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 360 states have internal predecessors, (528), 0 states have call successors, (0), 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:47:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:02,895 INFO L93 Difference]: Finished difference Result 395 states and 528 transitions. [2022-02-20 23:47:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 528 transitions. [2022-02-20 23:47:02,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:02,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:02,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 360 states have internal predecessors, (528), 0 states have call successors, (0), 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 395 states. [2022-02-20 23:47:02,897 INFO L87 Difference]: Start difference. First operand has 361 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 360 states have internal predecessors, (528), 0 states have call successors, (0), 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 395 states. [2022-02-20 23:47:02,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:02,910 INFO L93 Difference]: Finished difference Result 395 states and 528 transitions. [2022-02-20 23:47:02,910 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 528 transitions. [2022-02-20 23:47:02,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:02,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:02,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:02,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 360 states have internal predecessors, (528), 0 states have call successors, (0), 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:47:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 528 transitions. [2022-02-20 23:47:02,918 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 528 transitions. Word has length 19 [2022-02-20 23:47:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:02,919 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 528 transitions. [2022-02-20 23:47:02,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 528 transitions. [2022-02-20 23:47:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:47:02,920 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:02,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:02,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:47:02,920 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:47:02,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash -727311539, now seen corresponding path program 1 times [2022-02-20 23:47:02,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:02,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363972264] [2022-02-20 23:47:02,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:02,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:02,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {18572#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(16, 2); {18572#true} is VALID [2022-02-20 23:47:02,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {18572#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {18572#true} is VALID [2022-02-20 23:47:02,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {18572#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {18572#true} is VALID [2022-02-20 23:47:02,952 INFO L290 TraceCheckUtils]: 3: Hoare triple {18572#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {18572#true} is VALID [2022-02-20 23:47:02,954 INFO L290 TraceCheckUtils]: 4: Hoare triple {18572#true} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {18572#true} is VALID [2022-02-20 23:47:02,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {18572#true} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {18572#true} is VALID [2022-02-20 23:47:02,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {18572#true} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {18572#true} is VALID [2022-02-20 23:47:02,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {18572#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {18572#true} is VALID [2022-02-20 23:47:02,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {18572#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {18572#true} is VALID [2022-02-20 23:47:02,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {18572#true} SUMMARY for call write~$Pointer$(main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, 4); srcloc: L542-2 {18572#true} is VALID [2022-02-20 23:47:02,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {18572#true} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {18572#true} is VALID [2022-02-20 23:47:02,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {18572#true} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {18572#true} is VALID [2022-02-20 23:47:02,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {18572#true} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1; {18572#true} is VALID [2022-02-20 23:47:02,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {18572#true} goto; {18572#true} is VALID [2022-02-20 23:47:02,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {18572#true} assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647; {18572#true} is VALID [2022-02-20 23:47:02,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {18572#true} assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1; {18572#true} is VALID [2022-02-20 23:47:02,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {18572#true} assume !!(0 != main_~tree~0#1.base || 0 != main_~tree~0#1.offset);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_~tree~0#1.base, main_~tree~0#1.offset;main_~pred~0#1.base, main_~pred~0#1.offset := 0, 0; {18572#true} is VALID [2022-02-20 23:47:02,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {18572#true} SUMMARY for call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); srcloc: L596-3 {18572#true} is VALID [2022-02-20 23:47:02,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {18572#true} main_#t~short38#1 := 0 != main_#t~mem36#1.base || 0 != main_#t~mem36#1.offset; {18572#true} is VALID [2022-02-20 23:47:02,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {18572#true} assume main_#t~short38#1; {18574#|ULTIMATE.start_main_#t~short38#1|} is VALID [2022-02-20 23:47:02,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {18574#|ULTIMATE.start_main_#t~short38#1|} assume !main_#t~short38#1;havoc main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;havoc main_#t~short38#1; {18573#false} is VALID [2022-02-20 23:47:02,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {18573#false} assume 0 != main_~pred~0#1.base || 0 != main_~pred~0#1.offset; {18573#false} is VALID [2022-02-20 23:47:02,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {18573#false} assume !(1 == #valid[main_~pred~0#1.base]); {18573#false} is VALID [2022-02-20 23:47:02,963 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:47:02,963 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:02,963 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363972264] [2022-02-20 23:47:02,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363972264] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:02,963 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:02,963 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:02,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433436494] [2022-02-20 23:47:02,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:02,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:47:02,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:02,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:02,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:02,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:02,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:02,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:02,980 INFO L87 Difference]: Start difference. First operand 361 states and 528 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,108 INFO L93 Difference]: Finished difference Result 365 states and 532 transitions. [2022-02-20 23:47:03,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:03,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:47:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2022-02-20 23:47:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2022-02-20 23:47:03,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 185 transitions. [2022-02-20 23:47:03,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:03,226 INFO L225 Difference]: With dead ends: 365 [2022-02-20 23:47:03,227 INFO L226 Difference]: Without dead ends: 365 [2022-02-20 23:47:03,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:47:03,227 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:03,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-02-20 23:47:03,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-02-20 23:47:03,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:03,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 365 states. Second operand has 365 states, 302 states have (on average 1.7615894039735098) internal successors, (532), 364 states have internal predecessors, (532), 0 states have call successors, (0), 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:47:03,233 INFO L74 IsIncluded]: Start isIncluded. First operand 365 states. Second operand has 365 states, 302 states have (on average 1.7615894039735098) internal successors, (532), 364 states have internal predecessors, (532), 0 states have call successors, (0), 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:47:03,234 INFO L87 Difference]: Start difference. First operand 365 states. Second operand has 365 states, 302 states have (on average 1.7615894039735098) internal successors, (532), 364 states have internal predecessors, (532), 0 states have call successors, (0), 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:47:03,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,241 INFO L93 Difference]: Finished difference Result 365 states and 532 transitions. [2022-02-20 23:47:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 532 transitions. [2022-02-20 23:47:03,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:03,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:03,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 365 states, 302 states have (on average 1.7615894039735098) internal successors, (532), 364 states have internal predecessors, (532), 0 states have call successors, (0), 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 365 states. [2022-02-20 23:47:03,243 INFO L87 Difference]: Start difference. First operand has 365 states, 302 states have (on average 1.7615894039735098) internal successors, (532), 364 states have internal predecessors, (532), 0 states have call successors, (0), 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 365 states. [2022-02-20 23:47:03,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,250 INFO L93 Difference]: Finished difference Result 365 states and 532 transitions. [2022-02-20 23:47:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 532 transitions. [2022-02-20 23:47:03,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:03,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:03,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:03,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 302 states have (on average 1.7615894039735098) internal successors, (532), 364 states have internal predecessors, (532), 0 states have call successors, (0), 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:47:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 532 transitions. [2022-02-20 23:47:03,259 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 532 transitions. Word has length 23 [2022-02-20 23:47:03,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:03,259 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 532 transitions. [2022-02-20 23:47:03,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 532 transitions. [2022-02-20 23:47:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:47:03,260 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:03,260 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:03,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:47:03,260 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:47:03,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:03,261 INFO L85 PathProgramCache]: Analyzing trace with hash 97933121, now seen corresponding path program 1 times [2022-02-20 23:47:03,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:03,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99938090] [2022-02-20 23:47:03,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:03,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:03,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {20037#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(16, 2); {20037#true} is VALID [2022-02-20 23:47:03,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {20037#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {20037#true} is VALID [2022-02-20 23:47:03,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {20037#true} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {20039#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:47:03,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {20039#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {20039#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:47:03,449 INFO L290 TraceCheckUtils]: 4: Hoare triple {20039#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {20040#(not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|))} is VALID [2022-02-20 23:47:03,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {20040#(not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:03,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:03,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {20042#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:03,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {20042#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {20042#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:03,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {20042#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, 4); srcloc: L542-2 {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:03,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:03,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:03,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {20043#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:03,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {20043#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {20044#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:03,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {20044#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_#t~mem9#1.base, main_#t~mem9#1.offset, 4); srcloc: L546-1 {20045#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:03,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {20045#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~mem10#1.base, main_#t~mem10#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset, 4); srcloc: L546-2 {20046#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:03,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {20046#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {20046#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:03,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {20046#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L547 {20047#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= |ULTIMATE.start_main_#t~mem11#1.base| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:03,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {20047#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= |ULTIMATE.start_main_#t~mem11#1.base| |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~tmpList~0#1.base, main_~tmpList~0#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, 4); srcloc: L547-1 {20048#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} is VALID [2022-02-20 23:47:03,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {20048#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {20048#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} is VALID [2022-02-20 23:47:03,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {20048#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {20048#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} is VALID [2022-02-20 23:47:03,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {20048#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {20048#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} is VALID [2022-02-20 23:47:03,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {20048#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {20049#(= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)} is VALID [2022-02-20 23:47:03,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {20049#(= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)} assume !(1 == #valid[main_#t~mem9#1.base]); {20038#false} is VALID [2022-02-20 23:47:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:03,464 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:03,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99938090] [2022-02-20 23:47:03,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99938090] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:47:03,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777118734] [2022-02-20 23:47:03,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:03,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:47:03,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:47:03,472 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:47:03,475 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:47:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:03,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 23:47:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:03,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:03,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:03,751 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:03,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:47:03,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:47:03,861 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:03,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-02-20 23:47:03,904 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:47:03,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 23:47:03,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-02-20 23:47:04,282 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:04,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-02-20 23:47:04,403 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-02-20 23:47:04,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-02-20 23:47:04,484 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 31 treesize of output 13 [2022-02-20 23:47:04,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {20037#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(16, 2); {20037#true} is VALID [2022-02-20 23:47:04,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {20037#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {20039#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:47:04,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {20039#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {20039#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:47:04,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {20039#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {20039#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:47:04,526 INFO L290 TraceCheckUtils]: 4: Hoare triple {20039#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {20040#(not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|))} is VALID [2022-02-20 23:47:04,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {20040#(not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {20074#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_#t~mem5#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {20074#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_#t~mem5#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {20074#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_#t~mem5#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {20074#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_#t~mem5#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, 4); srcloc: L542-2 {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {20041#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {20090#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {20090#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {20090#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {20090#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_#t~mem9#1.base, main_#t~mem9#1.offset, 4); srcloc: L546-1 {20090#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {20090#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~mem10#1.base, main_#t~mem10#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset, 4); srcloc: L546-2 {20100#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (exists ((|ULTIMATE.start_main_~tmpList~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {20100#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (exists ((|ULTIMATE.start_main_~tmpList~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {20100#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (exists ((|ULTIMATE.start_main_~tmpList~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {20100#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (exists ((|ULTIMATE.start_main_~tmpList~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L547 {20107#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (exists ((|ULTIMATE.start_main_~tmpList~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_#t~mem11#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {20107#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (exists ((|ULTIMATE.start_main_~tmpList~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_#t~mem11#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~tmpList~0#1.base, main_~tmpList~0#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, 4); srcloc: L547-1 {20111#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {20111#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {20111#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {20111#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {20111#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {20111#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {20111#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:04,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {20111#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {20124#(and (exists ((|ULTIMATE.start_main_~tree~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_#t~mem9#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1))) (= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1))} is VALID [2022-02-20 23:47:04,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {20124#(and (exists ((|ULTIMATE.start_main_~tree~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_#t~mem9#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1))) (= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1))} assume !(1 == #valid[main_#t~mem9#1.base]); {20038#false} is VALID [2022-02-20 23:47:04,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:04,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:06,119 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462)) (.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (or (= (select (store .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store .cse1 .cse2 v_ArrVal_463) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)) 1) (not (= (select .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select .cse0 .cse2) 1)))))) is different from false [2022-02-20 23:47:06,974 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:06,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 70 [2022-02-20 23:47:07,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:47:07,033 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 380 treesize of output 320 [2022-02-20 23:47:07,150 INFO L356 Elim1Store]: treesize reduction 124, result has 23.0 percent of original size [2022-02-20 23:47:07,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 851 treesize of output 821 [2022-02-20 23:47:07,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 653 treesize of output 565 [2022-02-20 23:47:07,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 577 treesize of output 449 [2022-02-20 23:47:10,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {20049#(= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)} assume !(1 == #valid[main_#t~mem9#1.base]); {20038#false} is VALID [2022-02-20 23:47:10,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {20048#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {20049#(= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)} is VALID [2022-02-20 23:47:10,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {20134#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {20048#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)} is VALID [2022-02-20 23:47:10,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {20134#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {20134#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} is VALID [2022-02-20 23:47:10,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {20134#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {20134#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} is VALID [2022-02-20 23:47:10,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {20144#(or (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (v_ArrVal_463 (Array Int Int))) (or (= 1 (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0)))) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|) 1)))} SUMMARY for call write~$Pointer$(main_~tmpList~0#1.base, main_~tmpList~0#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, 4); srcloc: L547-1 {20134#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} is VALID [2022-02-20 23:47:10,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {20148#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (v_ArrVal_463 (Array Int Int))) (or (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0)) (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1))))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L547 {20144#(or (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (v_ArrVal_463 (Array Int Int))) (or (= 1 (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0)))) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|) 1)))} is VALID [2022-02-20 23:47:10,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {20148#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (v_ArrVal_463 (Array Int Int))) (or (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0)) (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1))))} havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {20148#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (v_ArrVal_463 (Array Int Int))) (or (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0)) (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1))))} is VALID [2022-02-20 23:47:10,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {20155#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (not (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} SUMMARY for call write~$Pointer$(main_#t~mem10#1.base, main_#t~mem10#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset, 4); srcloc: L546-2 {20148#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (v_ArrVal_463 (Array Int Int))) (or (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0)) (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1))))} is VALID [2022-02-20 23:47:10,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {20155#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (not (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_#t~mem9#1.base, main_#t~mem9#1.offset, 4); srcloc: L546-1 {20155#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (not (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} is VALID [2022-02-20 23:47:10,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {20155#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (not (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {20155#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (not (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} is VALID [2022-02-20 23:47:10,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {20165#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (= (select (store (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {20155#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (not (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} is VALID [2022-02-20 23:47:10,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {20165#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (= (select (store (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {20165#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (= (select (store (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} is VALID [2022-02-20 23:47:10,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {20165#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (= (select (store (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {20165#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (= (select (store (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} is VALID [2022-02-20 23:47:10,063 WARN L290 TraceCheckUtils]: 9: Hoare triple {20175#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (= (select (store (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} SUMMARY for call write~$Pointer$(main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, 4); srcloc: L542-2 {20165#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (= (select (store (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} is UNKNOWN [2022-02-20 23:47:10,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {20175#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (= (select (store (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {20175#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (= (select (store (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} is VALID [2022-02-20 23:47:10,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {20182#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (= (select (store (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {20175#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (= (select (store (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} is VALID [2022-02-20 23:47:10,070 WARN L290 TraceCheckUtils]: 6: Hoare triple {20182#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (= (select (store (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {20182#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (= (select (store (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} is UNKNOWN [2022-02-20 23:47:10,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {20040#(not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {20182#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (= (select (store (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_463) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1)) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select (store |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1) |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))} is VALID [2022-02-20 23:47:10,072 INFO L290 TraceCheckUtils]: 4: Hoare triple {20192#(not (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 0))} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {20040#(not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|))} is VALID [2022-02-20 23:47:10,073 INFO L290 TraceCheckUtils]: 3: Hoare triple {20192#(not (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {20192#(not (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 0))} is VALID [2022-02-20 23:47:10,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {20192#(not (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {20192#(not (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 0))} is VALID [2022-02-20 23:47:10,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {20037#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {20192#(not (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 0))} is VALID [2022-02-20 23:47:10,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {20037#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(16, 2); {20037#true} is VALID [2022-02-20 23:47:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:10,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777118734] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:10,076 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:47:10,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 26 [2022-02-20 23:47:10,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372877421] [2022-02-20 23:47:10,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:10,077 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 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 24 [2022-02-20 23:47:10,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:10,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 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:47:10,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:10,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-20 23:47:10,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:10,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-20 23:47:10,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=526, Unknown=6, NotChecked=48, Total=702 [2022-02-20 23:47:10,164 INFO L87 Difference]: Start difference. First operand 365 states and 532 transitions. Second operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 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:47:13,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:13,278 INFO L93 Difference]: Finished difference Result 701 states and 997 transitions. [2022-02-20 23:47:13,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:47:13,279 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 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 24 [2022-02-20 23:47:13,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 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:47:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 412 transitions. [2022-02-20 23:47:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 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:47:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 412 transitions. [2022-02-20 23:47:13,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 412 transitions. [2022-02-20 23:47:13,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 412 edges. 412 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:13,619 INFO L225 Difference]: With dead ends: 701 [2022-02-20 23:47:13,619 INFO L226 Difference]: Without dead ends: 701 [2022-02-20 23:47:13,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=779, Unknown=6, NotChecked=60, Total=1056 [2022-02-20 23:47:13,620 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 626 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 2407 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1162 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:13,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [626 Valid, 2407 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 871 Invalid, 0 Unknown, 1162 Unchecked, 0.7s Time] [2022-02-20 23:47:13,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2022-02-20 23:47:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 364. [2022-02-20 23:47:13,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:13,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 701 states. Second operand has 364 states, 302 states have (on average 1.7582781456953642) internal successors, (531), 363 states have internal predecessors, (531), 0 states have call successors, (0), 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:47:13,627 INFO L74 IsIncluded]: Start isIncluded. First operand 701 states. Second operand has 364 states, 302 states have (on average 1.7582781456953642) internal successors, (531), 363 states have internal predecessors, (531), 0 states have call successors, (0), 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:47:13,627 INFO L87 Difference]: Start difference. First operand 701 states. Second operand has 364 states, 302 states have (on average 1.7582781456953642) internal successors, (531), 363 states have internal predecessors, (531), 0 states have call successors, (0), 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:47:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:13,646 INFO L93 Difference]: Finished difference Result 701 states and 997 transitions. [2022-02-20 23:47:13,646 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 997 transitions. [2022-02-20 23:47:13,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:13,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:13,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 302 states have (on average 1.7582781456953642) internal successors, (531), 363 states have internal predecessors, (531), 0 states have call successors, (0), 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 701 states. [2022-02-20 23:47:13,648 INFO L87 Difference]: Start difference. First operand has 364 states, 302 states have (on average 1.7582781456953642) internal successors, (531), 363 states have internal predecessors, (531), 0 states have call successors, (0), 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 701 states. [2022-02-20 23:47:13,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:13,667 INFO L93 Difference]: Finished difference Result 701 states and 997 transitions. [2022-02-20 23:47:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 997 transitions. [2022-02-20 23:47:13,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:13,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:13,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:13,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:13,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 302 states have (on average 1.7582781456953642) internal successors, (531), 363 states have internal predecessors, (531), 0 states have call successors, (0), 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:47:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 531 transitions. [2022-02-20 23:47:13,673 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 531 transitions. Word has length 24 [2022-02-20 23:47:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:13,673 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 531 transitions. [2022-02-20 23:47:13,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 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:47:13,674 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 531 transitions. [2022-02-20 23:47:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:47:13,674 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:13,674 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:13,692 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:47:13,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-20 23:47:13,879 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2022-02-20 23:47:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:13,880 INFO L85 PathProgramCache]: Analyzing trace with hash 97933122, now seen corresponding path program 1 times [2022-02-20 23:47:13,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:13,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826616540] [2022-02-20 23:47:13,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:13,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:14,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {22686#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(16, 2); {22686#true} is VALID [2022-02-20 23:47:14,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {22686#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {22688#(= |ULTIMATE.start_main_~tree~0#1.offset| 0)} is VALID [2022-02-20 23:47:14,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {22688#(= |ULTIMATE.start_main_~tree~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {22688#(= |ULTIMATE.start_main_~tree~0#1.offset| 0)} is VALID [2022-02-20 23:47:14,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {22688#(= |ULTIMATE.start_main_~tree~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {22688#(= |ULTIMATE.start_main_~tree~0#1.offset| 0)} is VALID [2022-02-20 23:47:14,409 INFO L290 TraceCheckUtils]: 4: Hoare triple {22688#(= |ULTIMATE.start_main_~tree~0#1.offset| 0)} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {22689#(and (or (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) 4))} is VALID [2022-02-20 23:47:14,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {22689#(and (or (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) 4))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {22690#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (or (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} is VALID [2022-02-20 23:47:14,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {22690#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (or (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {22690#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (or (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} is VALID [2022-02-20 23:47:14,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {22690#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (or (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {22691#(and (or (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)) (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (or (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) 4) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_#t~mem5#1.base|))))} is VALID [2022-02-20 23:47:14,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {22691#(and (or (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)) (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (or (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) 4) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_#t~mem5#1.base|))))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {22691#(and (or (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)) (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (or (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) 4) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_#t~mem5#1.base|))))} is VALID [2022-02-20 23:47:14,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {22691#(and (or (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)) (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (or (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~tree~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) 4) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_#t~mem5#1.base|))))} SUMMARY for call write~$Pointer$(main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, 4); srcloc: L542-2 {22692#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4)) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} is VALID [2022-02-20 23:47:14,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {22692#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4)) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {22692#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4)) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} is VALID [2022-02-20 23:47:14,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {22692#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4)) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {22692#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4)) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} is VALID [2022-02-20 23:47:14,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {22692#(and (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4)) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {22693#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (or (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4))) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4)) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} is VALID [2022-02-20 23:47:14,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {22693#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (or (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4))) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4)) (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {22694#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|) 4) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} is VALID [2022-02-20 23:47:14,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {22694#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|) 4) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_#t~mem9#1.base, main_#t~mem9#1.offset, 4); srcloc: L546-1 {22695#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} is VALID [2022-02-20 23:47:14,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {22695#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} SUMMARY for call write~$Pointer$(main_#t~mem10#1.base, main_#t~mem10#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset, 4); srcloc: L546-2 {22695#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} is VALID [2022-02-20 23:47:14,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {22695#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {22695#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} is VALID [2022-02-20 23:47:14,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {22695#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L547 {22696#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)) (not (= |ULTIMATE.start_main_#t~mem11#1.base| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:14,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {22696#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)) (not (= |ULTIMATE.start_main_#t~mem11#1.base| |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~tmpList~0#1.base, main_~tmpList~0#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, 4); srcloc: L547-1 {22697#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} is VALID [2022-02-20 23:47:14,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {22697#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {22697#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} is VALID [2022-02-20 23:47:14,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {22697#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {22697#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} is VALID [2022-02-20 23:47:14,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {22697#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4) (not (= (select |#length| |ULTIMATE.start_main_~tree~0#1.base|) 4)))} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {22698#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} is VALID [2022-02-20 23:47:14,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {22698#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 4))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {22699#(and (= (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|) 4) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} is VALID [2022-02-20 23:47:14,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {22699#(and (= (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|) 4) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} assume !(4 + main_#t~mem9#1.offset <= #length[main_#t~mem9#1.base] && 0 <= main_#t~mem9#1.offset); {22687#false} is VALID [2022-02-20 23:47:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:14,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:14,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826616540] [2022-02-20 23:47:14,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826616540] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:47:14,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304423033] [2022-02-20 23:47:14,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:14,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:47:14,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:47:14,428 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:47:14,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:47:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:14,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 43 conjunts are in the unsatisfiable core [2022-02-20 23:47:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:14,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:14,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:14,598 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:14,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:47:14,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:47:14,642 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 13 treesize of output 9 [2022-02-20 23:47:14,728 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:14,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-02-20 23:47:14,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-02-20 23:47:14,779 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:14,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:47:14,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-02-20 23:47:14,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 23:47:15,094 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:15,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-02-20 23:47:15,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-02-20 23:47:15,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:15,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-20 23:47:15,198 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-02-20 23:47:15,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-02-20 23:47:15,272 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 31 treesize of output 13 [2022-02-20 23:47:15,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:47:15,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {22686#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(16, 2); {22686#true} is VALID [2022-02-20 23:47:15,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {22686#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {22706#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:47:15,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {22706#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {22706#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:47:15,321 INFO L290 TraceCheckUtils]: 3: Hoare triple {22706#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {22706#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} is VALID [2022-02-20 23:47:15,322 INFO L290 TraceCheckUtils]: 4: Hoare triple {22706#(= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1)} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {22716#(and (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {22716#(and (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {22720#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {22720#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {22720#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {22720#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {22727#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_#t~mem5#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {22727#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_#t~mem5#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {22727#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_#t~mem5#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {22727#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_#t~mem5#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, 4); srcloc: L542-2 {22720#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {22720#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {22720#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {22720#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {22720#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {22720#(and (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {22743#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {22743#(and (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {22747#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {22747#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_#t~mem9#1.base, main_#t~mem9#1.offset, 4); srcloc: L546-1 {22751#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {22751#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (not (= |ULTIMATE.start_main_~tree~0#1.base| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~mem10#1.base, main_#t~mem10#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset, 4); srcloc: L546-2 {22755#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {22755#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {22755#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {22755#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L547 {22762#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_#t~mem11#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {22762#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_#t~mem11#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~tmpList~0#1.base, main_~tmpList~0#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, 4); srcloc: L547-1 {22755#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {22755#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {22755#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {22755#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {22755#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {22755#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {22775#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:15,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {22775#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {22779#(and (= |ULTIMATE.start_main_#t~mem9#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)))} is VALID [2022-02-20 23:47:15,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {22779#(and (= |ULTIMATE.start_main_#t~mem9#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)))} assume !(4 + main_#t~mem9#1.offset <= #length[main_#t~mem9#1.base] && 0 <= main_#t~mem9#1.offset); {22687#false} is VALID [2022-02-20 23:47:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:15,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:16,222 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:16,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 162 [2022-02-20 23:47:16,236 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:47:16,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-02-20 23:47:16,477 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) |c_ULTIMATE.start_main_#t~mem9#1.base|)) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_5) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_prenex_4) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))))) is different from false [2022-02-20 23:47:16,503 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)) 0)) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_5) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_prenex_4) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))))) is different from false [2022-02-20 23:47:16,882 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (and (forall ((v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558)) (.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_prenex_4) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (let ((.cse4 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0)))) is different from false [2022-02-20 23:47:19,546 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:19,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 161 [2022-02-20 23:47:19,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:19,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 121 [2022-02-20 23:47:19,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:47:19,625 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 704 treesize of output 566 [2022-02-20 23:47:19,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:47:19,725 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 966 treesize of output 918 [2022-02-20 23:47:19,782 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:47:19,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-02-20 23:47:19,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 182 [2022-02-20 23:47:19,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 170 [2022-02-20 23:47:19,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 98 [2022-02-20 23:47:20,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 319 treesize of output 239 [2022-02-20 23:47:20,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 207 [2022-02-20 23:47:20,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 254 [2022-02-20 23:47:20,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 114 [2022-02-20 23:47:20,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 198 [2022-02-20 23:47:20,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {22783#(and (<= 0 |ULTIMATE.start_main_#t~mem9#1.offset|) (<= (+ |ULTIMATE.start_main_#t~mem9#1.offset| 4) (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)))} assume !(4 + main_#t~mem9#1.offset <= #length[main_#t~mem9#1.base] && 0 <= main_#t~mem9#1.offset); {22687#false} is VALID [2022-02-20 23:47:20,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {22787#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {22783#(and (<= 0 |ULTIMATE.start_main_#t~mem9#1.offset|) (<= (+ |ULTIMATE.start_main_#t~mem9#1.offset| 4) (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)))} is VALID [2022-02-20 23:47:20,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {22791#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)) (and (forall ((v_ArrVal_564 Int)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 4) (select (store |#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))))} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {22787#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))} is VALID [2022-02-20 23:47:20,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {22791#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)) (and (forall ((v_ArrVal_564 Int)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 4) (select (store |#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {22791#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)) (and (forall ((v_ArrVal_564 Int)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 4) (select (store |#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))))} is VALID [2022-02-20 23:47:20,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {22791#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)) (and (forall ((v_ArrVal_564 Int)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 4) (select (store |#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))))} havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {22791#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)) (and (forall ((v_ArrVal_564 Int)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 4) (select (store |#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))))} is VALID [2022-02-20 23:47:20,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {22801#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (or (and (forall ((v_ArrVal_564 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 4) (select (store |#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))) (forall ((v_ArrVal_562 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0))))} SUMMARY for call write~$Pointer$(main_~tmpList~0#1.base, main_~tmpList~0#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, 4); srcloc: L547-1 {22791#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)) (and (forall ((v_ArrVal_564 Int)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 4) (select (store |#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))))} is VALID [2022-02-20 23:47:20,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {22805#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)) (and (forall ((v_ArrVal_562 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_564 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 4) (select (store |#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))))))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L547 {22801#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (or (and (forall ((v_ArrVal_564 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 4) (select (store |#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))) (forall ((v_ArrVal_562 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0))))} is VALID [2022-02-20 23:47:20,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {22805#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)) (and (forall ((v_ArrVal_562 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_564 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 4) (select (store |#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))))))} havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {22805#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)) (and (forall ((v_ArrVal_562 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_564 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 4) (select (store |#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))))))} is VALID [2022-02-20 23:47:20,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {22812#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (or (and (forall ((v_ArrVal_564 Int) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (<= (+ (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 4) (select (store |#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0))))} SUMMARY for call write~$Pointer$(main_#t~mem10#1.base, main_#t~mem10#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset, 4); srcloc: L546-2 {22805#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)) (and (forall ((v_ArrVal_562 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_564 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 4) (select (store |#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))))))} is VALID [2022-02-20 23:47:20,718 WARN L290 TraceCheckUtils]: 14: Hoare triple {22816#(and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0)) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_5) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_#t~mem9#1.base, main_#t~mem9#1.offset, 4); srcloc: L546-1 {22812#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (or (and (forall ((v_ArrVal_564 Int) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (<= (+ (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 4) (select (store |#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0))))} is UNKNOWN [2022-02-20 23:47:20,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {22820#(and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0)) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_5) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L546 {22816#(and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0)) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_5) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))))} is VALID [2022-02-20 23:47:20,741 WARN L290 TraceCheckUtils]: 12: Hoare triple {22824#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) (select (select (store (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))))} assume !!(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~tmpList~0#1.base, main_~tmpList~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {22820#(and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0)) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_5) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))))} is UNKNOWN [2022-02-20 23:47:20,844 WARN L290 TraceCheckUtils]: 11: Hoare triple {22824#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) (select (select (store (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {22824#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) (select (select (store (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))))} is UNKNOWN [2022-02-20 23:47:20,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {22824#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) (select (select (store (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))))} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {22824#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) (select (select (store (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))))} is VALID [2022-02-20 23:47:20,862 WARN L290 TraceCheckUtils]: 9: Hoare triple {22834#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (and (forall ((v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))))} SUMMARY for call write~$Pointer$(main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, 4); srcloc: L542-2 {22824#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) (select (select (store (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))))} is UNKNOWN [2022-02-20 23:47:20,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {22834#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (and (forall ((v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542-1 {22834#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (and (forall ((v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))))} is VALID [2022-02-20 23:47:21,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {22841#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (and (forall ((v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) (select (select (store (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L542 {22834#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (and (forall ((v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))))} is VALID [2022-02-20 23:47:21,726 WARN L290 TraceCheckUtils]: 6: Hoare triple {22841#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (and (forall ((v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) (select (select (store (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {22841#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (and (forall ((v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) (select (select (store (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))))} is UNKNOWN [2022-02-20 23:47:21,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {22716#(and (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~tree~0#1.base, 8 + main_~tree~0#1.offset, 4); srcloc: L541 {22841#(forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (and (forall ((v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) (select (select (store (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_563) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_prenex_4) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_562) |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|)) 0))) (not (= (select |#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))))} is VALID [2022-02-20 23:47:21,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {22851#(not (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 0))} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4); {22716#(and (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~tree~0#1.base|)))} is VALID [2022-02-20 23:47:21,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {22851#(not (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, 4 + main_~tree~0#1.offset, 4); srcloc: L539-1 {22851#(not (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 0))} is VALID [2022-02-20 23:47:21,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {22851#(not (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~tree~0#1.base, main_~tree~0#1.offset, 4); srcloc: L539 {22851#(not (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 0))} is VALID [2022-02-20 23:47:21,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {22686#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet7#1, main_#t~nondet16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~nondet20#1, main_#t~short21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~nondet24#1, main_#t~short25#1, main_#t~malloc26#1.base, main_#t~malloc26#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~nondet31#1, main_~newNode~0#1.base, main_~newNode~0#1.offset, main_#t~nondet12#1, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~short38#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~tree~0#1.base, main_~tree~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~tmpList~0#1.base, main_~tmpList~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~tree~0#1.base, main_~tree~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmpList~0#1.base, main_~tmpList~0#1.offset; {22851#(not (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 0))} is VALID [2022-02-20 23:47:21,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {22686#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(16, 2); {22686#true} is VALID [2022-02-20 23:47:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-20 23:47:21,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304423033] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:21,732 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:47:21,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 36 [2022-02-20 23:47:21,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424149294] [2022-02-20 23:47:21,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:21,733 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 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 24 [2022-02-20 23:47:21,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:21,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 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:47:24,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 61 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:24,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-02-20 23:47:24,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:24,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-02-20 23:47:24,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=972, Unknown=21, NotChecked=198, Total=1332 [2022-02-20 23:47:24,128 INFO L87 Difference]: Start difference. First operand 364 states and 531 transitions. Second operand has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)