/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:42:58,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:42:58,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:42:58,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:42:58,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:42:58,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:42:58,149 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:42:58,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:42:58,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:42:58,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:42:58,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:42:58,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:42:58,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:42:58,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:42:58,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:42:58,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:42:58,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:42:58,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:42:58,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:42:58,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:42:58,175 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:42:58,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:42:58,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:42:58,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:42:58,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:42:58,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:42:58,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:42:58,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:42:58,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:42:58,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:42:58,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:42:58,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:42:58,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:42:58,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:42:58,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:42:58,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:42:58,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:42:58,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:42:58,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:42:58,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:42:58,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:42:58,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:42:58,192 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:42:58,201 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:42:58,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:42:58,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:42:58,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:42:58,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:42:58,203 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:42:58,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:42:58,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:42:58,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:42:58,204 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:42:58,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:42:58,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:42:58,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:42:58,204 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:42:58,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:42:58,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:42:58,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:42:58,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:42:58,205 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:42:58,205 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:42:58,205 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:42:58,205 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:42:58,205 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 10:42:58,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:42:58,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:42:58,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:42:58,431 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:42:58,431 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:42:58,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2022-04-28 10:42:58,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3d533025/7b1bdfee4ce140639826505ae441dd05/FLAGa74a159aa [2022-04-28 10:42:58,803 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:42:58,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2022-04-28 10:42:58,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3d533025/7b1bdfee4ce140639826505ae441dd05/FLAGa74a159aa [2022-04-28 10:42:59,225 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3d533025/7b1bdfee4ce140639826505ae441dd05 [2022-04-28 10:42:59,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:42:59,228 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:42:59,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:42:59,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:42:59,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:42:59,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:42:59" (1/1) ... [2022-04-28 10:42:59,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17b84150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:42:59, skipping insertion in model container [2022-04-28 10:42:59,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:42:59" (1/1) ... [2022-04-28 10:42:59,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:42:59,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:42:59,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c[619,632] [2022-04-28 10:42:59,375 WARN L1550 CHandler]: Possible shadowing of function min [2022-04-28 10:42:59,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:42:59,397 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:42:59,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c[619,632] [2022-04-28 10:42:59,410 WARN L1550 CHandler]: Possible shadowing of function min [2022-04-28 10:42:59,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:42:59,436 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:42:59,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:42:59 WrapperNode [2022-04-28 10:42:59,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:42:59,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:42:59,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:42:59,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:42:59,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:42:59" (1/1) ... [2022-04-28 10:42:59,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:42:59" (1/1) ... [2022-04-28 10:42:59,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:42:59" (1/1) ... [2022-04-28 10:42:59,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:42:59" (1/1) ... [2022-04-28 10:42:59,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:42:59" (1/1) ... [2022-04-28 10:42:59,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:42:59" (1/1) ... [2022-04-28 10:42:59,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:42:59" (1/1) ... [2022-04-28 10:42:59,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:42:59,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:42:59,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:42:59,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:42:59,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:42:59" (1/1) ... [2022-04-28 10:42:59,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:42:59,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:42:59,526 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-04-28 10:42:59,532 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-04-28 10:42:59,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:42:59,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:42:59,553 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:42:59,553 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:42:59,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:42:59,553 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-04-28 10:42:59,553 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-04-28 10:42:59,553 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-04-28 10:42:59,553 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-04-28 10:42:59,554 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-04-28 10:42:59,554 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2022-04-28 10:42:59,554 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:42:59,554 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 10:42:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 10:42:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 10:42:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-28 10:42:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:42:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-28 10:42:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:42:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:42:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:42:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:42:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:42:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:42:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-04-28 10:42:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 10:42:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:42:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 10:42:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-04-28 10:42:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 10:42:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-04-28 10:42:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:42:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:42:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-04-28 10:42:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-04-28 10:42:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure task [2022-04-28 10:42:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 10:42:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 10:42:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:42:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:42:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:42:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:42:59,662 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:42:59,663 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:42:59,954 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:42:59,960 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:42:59,960 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 10:42:59,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:42:59 BoogieIcfgContainer [2022-04-28 10:42:59,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:42:59,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:42:59,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:42:59,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:42:59,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:42:59" (1/3) ... [2022-04-28 10:42:59,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa8391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:42:59, skipping insertion in model container [2022-04-28 10:42:59,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:42:59" (2/3) ... [2022-04-28 10:42:59,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa8391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:42:59, skipping insertion in model container [2022-04-28 10:42:59,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:42:59" (3/3) ... [2022-04-28 10:42:59,970 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2022-04-28 10:42:59,980 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:42:59,980 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:43:00,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:43:00,027 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ef69bba, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@585142d3 [2022-04-28 10:43:00,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:43:00,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 10:43:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:43:00,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:00,045 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:00,045 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1536185801, now seen corresponding path program 1 times [2022-04-28 10:43:00,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:00,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [208212816] [2022-04-28 10:43:00,070 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:43:00,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1536185801, now seen corresponding path program 2 times [2022-04-28 10:43:00,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:00,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757242003] [2022-04-28 10:43:00,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:00,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:00,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:43:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:00,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(26, 2);call #Ultimate.allocInit(12, 3); {99#true} is VALID [2022-04-28 10:43:00,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-28 10:43:00,267 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {99#true} {99#true} #181#return; {99#true} is VALID [2022-04-28 10:43:00,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-28 10:43:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:00,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {127#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {99#true} is VALID [2022-04-28 10:43:00,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-28 10:43:00,286 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {99#true} {99#true} #139#return; {99#true} is VALID [2022-04-28 10:43:00,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:43:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:00,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {99#true} is VALID [2022-04-28 10:43:00,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {99#true} is VALID [2022-04-28 10:43:00,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-28 10:43:00,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99#true} {99#true} #151#return; {99#true} is VALID [2022-04-28 10:43:00,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 10:43:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:00,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {99#true} is VALID [2022-04-28 10:43:00,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {99#true} is VALID [2022-04-28 10:43:00,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-28 10:43:00,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99#true} {99#true} #153#return; {99#true} is VALID [2022-04-28 10:43:00,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-28 10:43:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:00,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} ~cond := #in~cond; {99#true} is VALID [2022-04-28 10:43:00,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume 0 == ~cond;assume false; {100#false} is VALID [2022-04-28 10:43:00,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#false} assume true; {100#false} is VALID [2022-04-28 10:43:00,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100#false} {99#true} #155#return; {100#false} is VALID [2022-04-28 10:43:00,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:43:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:00,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {128#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {99#true} is VALID [2022-04-28 10:43:00,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-28 10:43:00,313 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {99#true} {100#false} #157#return; {100#false} is VALID [2022-04-28 10:43:00,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-28 10:43:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:00,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {99#true} is VALID [2022-04-28 10:43:00,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {99#true} is VALID [2022-04-28 10:43:00,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-28 10:43:00,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99#true} {100#false} #159#return; {100#false} is VALID [2022-04-28 10:43:00,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {99#true} call ULTIMATE.init(); {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:43:00,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(26, 2);call #Ultimate.allocInit(12, 3); {99#true} is VALID [2022-04-28 10:43:00,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-28 10:43:00,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99#true} {99#true} #181#return; {99#true} is VALID [2022-04-28 10:43:00,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {99#true} call #t~ret45 := main(); {99#true} is VALID [2022-04-28 10:43:00,356 INFO L272 TraceCheckUtils]: 5: Hoare triple {99#true} call #t~ret44.base, #t~ret44.offset := nondet_tree(); {127#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 10:43:00,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {99#true} is VALID [2022-04-28 10:43:00,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-28 10:43:00,357 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {99#true} {99#true} #139#return; {99#true} is VALID [2022-04-28 10:43:00,357 INFO L272 TraceCheckUtils]: 9: Hoare triple {99#true} call task(#t~ret44.base, #t~ret44.offset); {99#true} is VALID [2022-04-28 10:43:00,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {99#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {99#true} is VALID [2022-04-28 10:43:00,357 INFO L272 TraceCheckUtils]: 11: Hoare triple {99#true} call #t~ret31 := min(~t.base, ~t.offset); {99#true} is VALID [2022-04-28 10:43:00,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {99#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {99#true} is VALID [2022-04-28 10:43:00,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {99#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {99#true} is VALID [2022-04-28 10:43:00,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-28 10:43:00,358 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99#true} {99#true} #151#return; {99#true} is VALID [2022-04-28 10:43:00,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {99#true} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;~a~1 := #t~ret31;havoc #t~ret31;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {99#true} is VALID [2022-04-28 10:43:00,358 INFO L272 TraceCheckUtils]: 17: Hoare triple {99#true} call #t~ret32 := size(~t.base, ~t.offset); {99#true} is VALID [2022-04-28 10:43:00,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {99#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {99#true} is VALID [2022-04-28 10:43:00,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {99#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {99#true} is VALID [2022-04-28 10:43:00,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-28 10:43:00,359 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {99#true} {99#true} #153#return; {99#true} is VALID [2022-04-28 10:43:00,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {99#true} assume -2147483648 <= #t~ret32 && #t~ret32 <= 2147483647;~n~1 := #t~ret32;havoc #t~ret32; {99#true} is VALID [2022-04-28 10:43:00,359 INFO L272 TraceCheckUtils]: 23: Hoare triple {99#true} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {99#true} is VALID [2022-04-28 10:43:00,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {99#true} ~cond := #in~cond; {99#true} is VALID [2022-04-28 10:43:00,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {99#true} assume 0 == ~cond;assume false; {100#false} is VALID [2022-04-28 10:43:00,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {100#false} assume true; {100#false} is VALID [2022-04-28 10:43:00,361 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {100#false} {99#true} #155#return; {100#false} is VALID [2022-04-28 10:43:00,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {100#false} call #t~malloc33.base, #t~malloc33.offset := #Ultimate.allocOnHeap(4 * ~n~1); {100#false} is VALID [2022-04-28 10:43:00,361 INFO L272 TraceCheckUtils]: 29: Hoare triple {100#false} call #Ultimate.meminit(#t~malloc33.base, #t~malloc33.offset, ~n~1, 4, 4 * ~n~1); {128#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:43:00,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {128#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {99#true} is VALID [2022-04-28 10:43:00,361 INFO L290 TraceCheckUtils]: 31: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-28 10:43:00,363 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {99#true} {100#false} #157#return; {100#false} is VALID [2022-04-28 10:43:00,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {100#false} ~x~0.base, ~x~0.offset := #t~malloc33.base, #t~malloc33.offset; {100#false} is VALID [2022-04-28 10:43:00,365 INFO L272 TraceCheckUtils]: 34: Hoare triple {100#false} call #t~ret34 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 10:43:00,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {99#true} is VALID [2022-04-28 10:43:00,366 INFO L290 TraceCheckUtils]: 36: Hoare triple {99#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {99#true} is VALID [2022-04-28 10:43:00,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-28 10:43:00,366 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {99#true} {100#false} #159#return; {100#false} is VALID [2022-04-28 10:43:00,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {100#false} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;call #t~mem35 := read~int(~x~0.base, ~x~0.offset, 4); {100#false} is VALID [2022-04-28 10:43:00,368 INFO L272 TraceCheckUtils]: 40: Hoare triple {100#false} call __VERIFIER_assert((if ~a~1 == #t~mem35 then 1 else 0)); {100#false} is VALID [2022-04-28 10:43:00,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {100#false} ~cond := #in~cond; {100#false} is VALID [2022-04-28 10:43:00,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {100#false} assume 0 == ~cond; {100#false} is VALID [2022-04-28 10:43:00,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {100#false} assume !false; {100#false} is VALID [2022-04-28 10:43:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:43:00,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:00,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757242003] [2022-04-28 10:43:00,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757242003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:00,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:00,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:43:00,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:00,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [208212816] [2022-04-28 10:43:00,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [208212816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:00,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:00,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:43:00,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335486307] [2022-04-28 10:43:00,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:00,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-04-28 10:43:00,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:00,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 10:43:00,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:00,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:43:00,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:00,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:43:00,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:43:00,479 INFO L87 Difference]: Start difference. First operand has 96 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 10:43:01,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:01,328 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2022-04-28 10:43:01,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:43:01,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-04-28 10:43:01,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 10:43:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2022-04-28 10:43:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 10:43:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2022-04-28 10:43:01,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 221 transitions. [2022-04-28 10:43:01,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:01,556 INFO L225 Difference]: With dead ends: 168 [2022-04-28 10:43:01,556 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 10:43:01,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:43:01,561 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:01,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 80 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:43:01,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 10:43:01,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2022-04-28 10:43:01,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:01,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 10:43:01,594 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 10:43:01,595 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 10:43:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:01,605 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2022-04-28 10:43:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2022-04-28 10:43:01,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:01,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:01,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 95 states. [2022-04-28 10:43:01,608 INFO L87 Difference]: Start difference. First operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 95 states. [2022-04-28 10:43:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:01,630 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2022-04-28 10:43:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2022-04-28 10:43:01,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:01,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:01,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:01,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 10:43:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-04-28 10:43:01,648 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 44 [2022-04-28 10:43:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:01,648 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-04-28 10:43:01,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 10:43:01,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 109 transitions. [2022-04-28 10:43:01,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:01,750 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-04-28 10:43:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:43:01,750 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:01,751 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:01,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:43:01,751 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:01,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash -152757941, now seen corresponding path program 1 times [2022-04-28 10:43:01,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:01,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [273799450] [2022-04-28 10:43:01,752 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:43:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash -152757941, now seen corresponding path program 2 times [2022-04-28 10:43:01,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:01,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112021259] [2022-04-28 10:43:01,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:01,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:01,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:43:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:01,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {869#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(26, 2);call #Ultimate.allocInit(12, 3); {840#true} is VALID [2022-04-28 10:43:01,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-28 10:43:01,839 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {840#true} {840#true} #181#return; {840#true} is VALID [2022-04-28 10:43:01,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-28 10:43:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:01,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {870#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {840#true} is VALID [2022-04-28 10:43:01,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-28 10:43:01,852 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {840#true} {840#true} #139#return; {840#true} is VALID [2022-04-28 10:43:01,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:43:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:01,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {840#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {840#true} is VALID [2022-04-28 10:43:01,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {840#true} is VALID [2022-04-28 10:43:01,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-28 10:43:01,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #151#return; {840#true} is VALID [2022-04-28 10:43:01,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 10:43:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:01,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {840#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {840#true} is VALID [2022-04-28 10:43:01,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {871#(= |size_#res| 0)} is VALID [2022-04-28 10:43:01,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {871#(= |size_#res| 0)} assume true; {871#(= |size_#res| 0)} is VALID [2022-04-28 10:43:01,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {871#(= |size_#res| 0)} {840#true} #153#return; {856#(= |task_#t~ret32| 0)} is VALID [2022-04-28 10:43:01,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-28 10:43:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:01,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {840#true} ~cond := #in~cond; {872#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 10:43:01,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {872#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {873#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:43:01,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {873#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:43:01,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {873#(not (= |assume_abort_if_not_#in~cond| 0))} {857#(= task_~n~1 0)} #155#return; {841#false} is VALID [2022-04-28 10:43:01,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 10:43:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:01,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {874#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {840#true} is VALID [2022-04-28 10:43:01,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-28 10:43:01,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {840#true} {841#false} #157#return; {841#false} is VALID [2022-04-28 10:43:01,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-28 10:43:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:01,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {875#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {840#true} is VALID [2022-04-28 10:43:01,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {840#true} is VALID [2022-04-28 10:43:01,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-28 10:43:01,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {841#false} #159#return; {841#false} is VALID [2022-04-28 10:43:01,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {869#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:43:01,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {869#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(26, 2);call #Ultimate.allocInit(12, 3); {840#true} is VALID [2022-04-28 10:43:01,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-28 10:43:01,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #181#return; {840#true} is VALID [2022-04-28 10:43:01,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret45 := main(); {840#true} is VALID [2022-04-28 10:43:01,920 INFO L272 TraceCheckUtils]: 5: Hoare triple {840#true} call #t~ret44.base, #t~ret44.offset := nondet_tree(); {870#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 10:43:01,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {870#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {840#true} is VALID [2022-04-28 10:43:01,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-28 10:43:01,921 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {840#true} {840#true} #139#return; {840#true} is VALID [2022-04-28 10:43:01,921 INFO L272 TraceCheckUtils]: 9: Hoare triple {840#true} call task(#t~ret44.base, #t~ret44.offset); {840#true} is VALID [2022-04-28 10:43:01,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {840#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {840#true} is VALID [2022-04-28 10:43:01,921 INFO L272 TraceCheckUtils]: 11: Hoare triple {840#true} call #t~ret31 := min(~t.base, ~t.offset); {840#true} is VALID [2022-04-28 10:43:01,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {840#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {840#true} is VALID [2022-04-28 10:43:01,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {840#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {840#true} is VALID [2022-04-28 10:43:01,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-28 10:43:01,922 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {840#true} {840#true} #151#return; {840#true} is VALID [2022-04-28 10:43:01,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {840#true} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;~a~1 := #t~ret31;havoc #t~ret31;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {840#true} is VALID [2022-04-28 10:43:01,922 INFO L272 TraceCheckUtils]: 17: Hoare triple {840#true} call #t~ret32 := size(~t.base, ~t.offset); {840#true} is VALID [2022-04-28 10:43:01,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {840#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {840#true} is VALID [2022-04-28 10:43:01,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {840#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {871#(= |size_#res| 0)} is VALID [2022-04-28 10:43:01,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {871#(= |size_#res| 0)} assume true; {871#(= |size_#res| 0)} is VALID [2022-04-28 10:43:01,923 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {871#(= |size_#res| 0)} {840#true} #153#return; {856#(= |task_#t~ret32| 0)} is VALID [2022-04-28 10:43:01,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {856#(= |task_#t~ret32| 0)} assume -2147483648 <= #t~ret32 && #t~ret32 <= 2147483647;~n~1 := #t~ret32;havoc #t~ret32; {857#(= task_~n~1 0)} is VALID [2022-04-28 10:43:01,924 INFO L272 TraceCheckUtils]: 23: Hoare triple {857#(= task_~n~1 0)} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {840#true} is VALID [2022-04-28 10:43:01,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {840#true} ~cond := #in~cond; {872#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 10:43:01,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {872#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {873#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:43:01,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {873#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {873#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:43:01,930 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {873#(not (= |assume_abort_if_not_#in~cond| 0))} {857#(= task_~n~1 0)} #155#return; {841#false} is VALID [2022-04-28 10:43:01,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {841#false} call #t~malloc33.base, #t~malloc33.offset := #Ultimate.allocOnHeap(4 * ~n~1); {841#false} is VALID [2022-04-28 10:43:01,930 INFO L272 TraceCheckUtils]: 29: Hoare triple {841#false} call #Ultimate.meminit(#t~malloc33.base, #t~malloc33.offset, ~n~1, 4, 4 * ~n~1); {874#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:43:01,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {874#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {840#true} is VALID [2022-04-28 10:43:01,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-28 10:43:01,930 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {840#true} {841#false} #157#return; {841#false} is VALID [2022-04-28 10:43:01,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {841#false} ~x~0.base, ~x~0.offset := #t~malloc33.base, #t~malloc33.offset; {841#false} is VALID [2022-04-28 10:43:01,931 INFO L272 TraceCheckUtils]: 34: Hoare triple {841#false} call #t~ret34 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {875#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 10:43:01,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {875#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {840#true} is VALID [2022-04-28 10:43:01,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {840#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {840#true} is VALID [2022-04-28 10:43:01,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-28 10:43:01,931 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {840#true} {841#false} #159#return; {841#false} is VALID [2022-04-28 10:43:01,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {841#false} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;call #t~mem35 := read~int(~x~0.base, ~x~0.offset, 4); {841#false} is VALID [2022-04-28 10:43:01,931 INFO L272 TraceCheckUtils]: 40: Hoare triple {841#false} call __VERIFIER_assert((if ~a~1 == #t~mem35 then 1 else 0)); {841#false} is VALID [2022-04-28 10:43:01,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {841#false} ~cond := #in~cond; {841#false} is VALID [2022-04-28 10:43:01,931 INFO L290 TraceCheckUtils]: 42: Hoare triple {841#false} assume 0 == ~cond; {841#false} is VALID [2022-04-28 10:43:01,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-28 10:43:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:43:01,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:01,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112021259] [2022-04-28 10:43:01,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112021259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:01,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:01,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:43:01,933 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:01,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [273799450] [2022-04-28 10:43:01,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [273799450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:01,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:01,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:43:01,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389810693] [2022-04-28 10:43:01,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:01,934 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-28 10:43:01,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:01,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 10:43:01,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:01,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:43:01,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:01,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:43:01,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:43:01,970 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 10:43:03,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:03,591 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2022-04-28 10:43:03,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:43:03,591 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-28 10:43:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 10:43:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2022-04-28 10:43:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 10:43:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2022-04-28 10:43:03,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 197 transitions. [2022-04-28 10:43:03,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:03,773 INFO L225 Difference]: With dead ends: 154 [2022-04-28 10:43:03,773 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 10:43:03,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:43:03,774 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 133 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:03,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 79 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:43:03,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 10:43:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2022-04-28 10:43:03,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:03,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-28 10:43:03,798 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-28 10:43:03,798 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-28 10:43:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:03,802 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-28 10:43:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2022-04-28 10:43:03,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:03,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:03,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) Second operand 97 states. [2022-04-28 10:43:03,803 INFO L87 Difference]: Start difference. First operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) Second operand 97 states. [2022-04-28 10:43:03,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:03,807 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-28 10:43:03,807 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2022-04-28 10:43:03,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:03,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:03,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:03,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:03,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-28 10:43:03,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2022-04-28 10:43:03,811 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 44 [2022-04-28 10:43:03,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:03,811 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2022-04-28 10:43:03,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 10:43:03,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 113 transitions. [2022-04-28 10:43:03,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-04-28 10:43:03,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 10:43:03,911 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:03,912 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:03,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:43:03,912 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:03,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:03,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2001282500, now seen corresponding path program 1 times [2022-04-28 10:43:03,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:03,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1215939782] [2022-04-28 10:43:03,913 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:43:03,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2001282500, now seen corresponding path program 2 times [2022-04-28 10:43:03,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:03,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859819134] [2022-04-28 10:43:03,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:03,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:03,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:43:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:03,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {1618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(26, 2);call #Ultimate.allocInit(12, 3); {1576#true} is VALID [2022-04-28 10:43:03,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:03,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1576#true} {1576#true} #181#return; {1576#true} is VALID [2022-04-28 10:43:03,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-28 10:43:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:04,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {1619#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {1620#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-04-28 10:43:04,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {1620#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1620#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-04-28 10:43:04,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1620#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} {1576#true} #139#return; {1584#(and (= |main_#t~ret44.offset| 0) (= |main_#t~ret44.base| 0))} is VALID [2022-04-28 10:43:04,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:43:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:04,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {1576#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1576#true} is VALID [2022-04-28 10:43:04,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1576#true} is VALID [2022-04-28 10:43:04,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} #151#return; {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-28 10:43:04,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 10:43:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:04,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-28 10:43:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:04,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-28 10:43:04,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-28 10:43:04,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1622#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} #177#return; {1622#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} is VALID [2022-04-28 10:43:04,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-28 10:43:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:04,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-28 10:43:04,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-28 10:43:04,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} #179#return; {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1621#(and (or (= size_~t.offset 0) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} is VALID [2022-04-28 10:43:04,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {1621#(and (or (= size_~t.offset 0) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {1622#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} is VALID [2022-04-28 10:43:04,108 INFO L272 TraceCheckUtils]: 2: Hoare triple {1622#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} call #t~ret28 := size(#t~mem27.base, #t~mem27.offset); {1576#true} is VALID [2022-04-28 10:43:04,109 INFO L290 TraceCheckUtils]: 3: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-28 10:43:04,109 INFO L290 TraceCheckUtils]: 4: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-28 10:43:04,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,109 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1576#true} {1622#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} #177#return; {1622#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} is VALID [2022-04-28 10:43:04,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {1622#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;call #t~mem29.base, #t~mem29.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,110 INFO L272 TraceCheckUtils]: 8: Hoare triple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} call #t~ret30 := size(#t~mem29.base, #t~mem29.offset); {1576#true} is VALID [2022-04-28 10:43:04,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-28 10:43:04,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-28 10:43:04,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,111 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1576#true} {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} #179#return; {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;#res := 1 + (#t~ret28 + #t~ret30);havoc #t~mem27.base, #t~mem27.offset;havoc #t~ret28;havoc #t~mem29.base, #t~mem29.offset;havoc #t~ret30; {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume true; {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,112 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} #153#return; {1577#false} is VALID [2022-04-28 10:43:04,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-28 10:43:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:04,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-28 10:43:04,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-28 10:43:04,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1577#false} #155#return; {1577#false} is VALID [2022-04-28 10:43:04,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-28 10:43:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:04,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {1632#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1576#true} is VALID [2022-04-28 10:43:04,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1576#true} {1577#false} #157#return; {1577#false} is VALID [2022-04-28 10:43:04,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 10:43:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:04,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {1633#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1576#true} is VALID [2022-04-28 10:43:04,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1576#true} is VALID [2022-04-28 10:43:04,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1577#false} #159#return; {1577#false} is VALID [2022-04-28 10:43:04,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:43:04,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {1618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(26, 2);call #Ultimate.allocInit(12, 3); {1576#true} is VALID [2022-04-28 10:43:04,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #181#return; {1576#true} is VALID [2022-04-28 10:43:04,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret45 := main(); {1576#true} is VALID [2022-04-28 10:43:04,149 INFO L272 TraceCheckUtils]: 5: Hoare triple {1576#true} call #t~ret44.base, #t~ret44.offset := nondet_tree(); {1619#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 10:43:04,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {1619#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {1620#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-04-28 10:43:04,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {1620#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1620#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-04-28 10:43:04,151 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1620#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} {1576#true} #139#return; {1584#(and (= |main_#t~ret44.offset| 0) (= |main_#t~ret44.base| 0))} is VALID [2022-04-28 10:43:04,151 INFO L272 TraceCheckUtils]: 9: Hoare triple {1584#(and (= |main_#t~ret44.offset| 0) (= |main_#t~ret44.base| 0))} call task(#t~ret44.base, #t~ret44.offset); {1585#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} is VALID [2022-04-28 10:43:04,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-28 10:43:04,152 INFO L272 TraceCheckUtils]: 11: Hoare triple {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} call #t~ret31 := min(~t.base, ~t.offset); {1576#true} is VALID [2022-04-28 10:43:04,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {1576#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1576#true} is VALID [2022-04-28 10:43:04,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1576#true} is VALID [2022-04-28 10:43:04,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,152 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1576#true} {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} #151#return; {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-28 10:43:04,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;~a~1 := #t~ret31;havoc #t~ret31;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-28 10:43:04,153 INFO L272 TraceCheckUtils]: 17: Hoare triple {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} call #t~ret32 := size(~t.base, ~t.offset); {1576#true} is VALID [2022-04-28 10:43:04,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1621#(and (or (= size_~t.offset 0) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} is VALID [2022-04-28 10:43:04,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {1621#(and (or (= size_~t.offset 0) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {1622#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} is VALID [2022-04-28 10:43:04,154 INFO L272 TraceCheckUtils]: 20: Hoare triple {1622#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} call #t~ret28 := size(#t~mem27.base, #t~mem27.offset); {1576#true} is VALID [2022-04-28 10:43:04,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-28 10:43:04,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-28 10:43:04,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,155 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1576#true} {1622#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} #177#return; {1622#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} is VALID [2022-04-28 10:43:04,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {1622#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;call #t~mem29.base, #t~mem29.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,155 INFO L272 TraceCheckUtils]: 26: Hoare triple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} call #t~ret30 := size(#t~mem29.base, #t~mem29.offset); {1576#true} is VALID [2022-04-28 10:43:04,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-28 10:43:04,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-28 10:43:04,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,156 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1576#true} {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} #179#return; {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;#res := 1 + (#t~ret28 + #t~ret30);havoc #t~mem27.base, #t~mem27.offset;havoc #t~ret28;havoc #t~mem29.base, #t~mem29.offset;havoc #t~ret30; {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume true; {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,157 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} #153#return; {1577#false} is VALID [2022-04-28 10:43:04,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {1577#false} assume -2147483648 <= #t~ret32 && #t~ret32 <= 2147483647;~n~1 := #t~ret32;havoc #t~ret32; {1577#false} is VALID [2022-04-28 10:43:04,157 INFO L272 TraceCheckUtils]: 35: Hoare triple {1577#false} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {1576#true} is VALID [2022-04-28 10:43:04,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-28 10:43:04,158 INFO L290 TraceCheckUtils]: 37: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-28 10:43:04,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,158 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1576#true} {1577#false} #155#return; {1577#false} is VALID [2022-04-28 10:43:04,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {1577#false} call #t~malloc33.base, #t~malloc33.offset := #Ultimate.allocOnHeap(4 * ~n~1); {1577#false} is VALID [2022-04-28 10:43:04,158 INFO L272 TraceCheckUtils]: 41: Hoare triple {1577#false} call #Ultimate.meminit(#t~malloc33.base, #t~malloc33.offset, ~n~1, 4, 4 * ~n~1); {1632#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:43:04,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {1632#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1576#true} is VALID [2022-04-28 10:43:04,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,158 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1576#true} {1577#false} #157#return; {1577#false} is VALID [2022-04-28 10:43:04,158 INFO L290 TraceCheckUtils]: 45: Hoare triple {1577#false} ~x~0.base, ~x~0.offset := #t~malloc33.base, #t~malloc33.offset; {1577#false} is VALID [2022-04-28 10:43:04,158 INFO L272 TraceCheckUtils]: 46: Hoare triple {1577#false} call #t~ret34 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {1633#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 10:43:04,158 INFO L290 TraceCheckUtils]: 47: Hoare triple {1633#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1576#true} is VALID [2022-04-28 10:43:04,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1576#true} is VALID [2022-04-28 10:43:04,159 INFO L290 TraceCheckUtils]: 49: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,159 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1576#true} {1577#false} #159#return; {1577#false} is VALID [2022-04-28 10:43:04,159 INFO L290 TraceCheckUtils]: 51: Hoare triple {1577#false} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;call #t~mem35 := read~int(~x~0.base, ~x~0.offset, 4); {1577#false} is VALID [2022-04-28 10:43:04,159 INFO L272 TraceCheckUtils]: 52: Hoare triple {1577#false} call __VERIFIER_assert((if ~a~1 == #t~mem35 then 1 else 0)); {1577#false} is VALID [2022-04-28 10:43:04,159 INFO L290 TraceCheckUtils]: 53: Hoare triple {1577#false} ~cond := #in~cond; {1577#false} is VALID [2022-04-28 10:43:04,159 INFO L290 TraceCheckUtils]: 54: Hoare triple {1577#false} assume 0 == ~cond; {1577#false} is VALID [2022-04-28 10:43:04,159 INFO L290 TraceCheckUtils]: 55: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-28 10:43:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:43:04,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:04,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859819134] [2022-04-28 10:43:04,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859819134] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:43:04,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225910264] [2022-04-28 10:43:04,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:43:04,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:04,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:04,164 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-04-28 10:43:04,171 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-04-28 10:43:04,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:43:04,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:04,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:43:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:04,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:04,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-28 10:43:04,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#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(26, 2);call #Ultimate.allocInit(12, 3); {1576#true} is VALID [2022-04-28 10:43:04,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #181#return; {1576#true} is VALID [2022-04-28 10:43:04,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret45 := main(); {1576#true} is VALID [2022-04-28 10:43:04,610 INFO L272 TraceCheckUtils]: 5: Hoare triple {1576#true} call #t~ret44.base, #t~ret44.offset := nondet_tree(); {1576#true} is VALID [2022-04-28 10:43:04,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {1576#true} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {1620#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-04-28 10:43:04,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {1620#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1620#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-04-28 10:43:04,612 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1620#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} {1576#true} #139#return; {1584#(and (= |main_#t~ret44.offset| 0) (= |main_#t~ret44.base| 0))} is VALID [2022-04-28 10:43:04,613 INFO L272 TraceCheckUtils]: 9: Hoare triple {1584#(and (= |main_#t~ret44.offset| 0) (= |main_#t~ret44.base| 0))} call task(#t~ret44.base, #t~ret44.offset); {1585#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} is VALID [2022-04-28 10:43:04,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-28 10:43:04,613 INFO L272 TraceCheckUtils]: 11: Hoare triple {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} call #t~ret31 := min(~t.base, ~t.offset); {1576#true} is VALID [2022-04-28 10:43:04,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {1576#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1576#true} is VALID [2022-04-28 10:43:04,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1576#true} is VALID [2022-04-28 10:43:04,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,614 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1576#true} {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} #151#return; {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-28 10:43:04,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;~a~1 := #t~ret31;havoc #t~ret31;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-28 10:43:04,615 INFO L272 TraceCheckUtils]: 17: Hoare triple {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} call #t~ret32 := size(~t.base, ~t.offset); {1576#true} is VALID [2022-04-28 10:43:04,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1691#(and (= |size_#in~t.offset| size_~t.offset) (= |size_#in~t.base| size_~t.base))} is VALID [2022-04-28 10:43:04,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {1691#(and (= |size_#in~t.offset| size_~t.offset) (= |size_#in~t.base| size_~t.base))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,616 INFO L272 TraceCheckUtils]: 20: Hoare triple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} call #t~ret28 := size(#t~mem27.base, #t~mem27.offset); {1576#true} is VALID [2022-04-28 10:43:04,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-28 10:43:04,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-28 10:43:04,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,617 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1576#true} {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} #177#return; {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;call #t~mem29.base, #t~mem29.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,617 INFO L272 TraceCheckUtils]: 26: Hoare triple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} call #t~ret30 := size(#t~mem29.base, #t~mem29.offset); {1576#true} is VALID [2022-04-28 10:43:04,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-28 10:43:04,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-28 10:43:04,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,618 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1576#true} {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} #179#return; {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;#res := 1 + (#t~ret28 + #t~ret30);havoc #t~mem27.base, #t~mem27.offset;havoc #t~ret28;havoc #t~mem29.base, #t~mem29.offset;havoc #t~ret30; {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume true; {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,619 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} #153#return; {1577#false} is VALID [2022-04-28 10:43:04,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {1577#false} assume -2147483648 <= #t~ret32 && #t~ret32 <= 2147483647;~n~1 := #t~ret32;havoc #t~ret32; {1577#false} is VALID [2022-04-28 10:43:04,620 INFO L272 TraceCheckUtils]: 35: Hoare triple {1577#false} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {1577#false} is VALID [2022-04-28 10:43:04,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {1577#false} ~cond := #in~cond; {1577#false} is VALID [2022-04-28 10:43:04,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {1577#false} assume !(0 == ~cond); {1577#false} is VALID [2022-04-28 10:43:04,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {1577#false} assume true; {1577#false} is VALID [2022-04-28 10:43:04,620 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1577#false} {1577#false} #155#return; {1577#false} is VALID [2022-04-28 10:43:04,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {1577#false} call #t~malloc33.base, #t~malloc33.offset := #Ultimate.allocOnHeap(4 * ~n~1); {1577#false} is VALID [2022-04-28 10:43:04,620 INFO L272 TraceCheckUtils]: 41: Hoare triple {1577#false} call #Ultimate.meminit(#t~malloc33.base, #t~malloc33.offset, ~n~1, 4, 4 * ~n~1); {1577#false} is VALID [2022-04-28 10:43:04,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {1577#false} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1577#false} is VALID [2022-04-28 10:43:04,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {1577#false} assume true; {1577#false} is VALID [2022-04-28 10:43:04,620 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1577#false} {1577#false} #157#return; {1577#false} is VALID [2022-04-28 10:43:04,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {1577#false} ~x~0.base, ~x~0.offset := #t~malloc33.base, #t~malloc33.offset; {1577#false} is VALID [2022-04-28 10:43:04,621 INFO L272 TraceCheckUtils]: 46: Hoare triple {1577#false} call #t~ret34 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {1577#false} is VALID [2022-04-28 10:43:04,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {1577#false} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1577#false} is VALID [2022-04-28 10:43:04,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {1577#false} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1577#false} is VALID [2022-04-28 10:43:04,621 INFO L290 TraceCheckUtils]: 49: Hoare triple {1577#false} assume true; {1577#false} is VALID [2022-04-28 10:43:04,621 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1577#false} {1577#false} #159#return; {1577#false} is VALID [2022-04-28 10:43:04,621 INFO L290 TraceCheckUtils]: 51: Hoare triple {1577#false} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;call #t~mem35 := read~int(~x~0.base, ~x~0.offset, 4); {1577#false} is VALID [2022-04-28 10:43:04,621 INFO L272 TraceCheckUtils]: 52: Hoare triple {1577#false} call __VERIFIER_assert((if ~a~1 == #t~mem35 then 1 else 0)); {1577#false} is VALID [2022-04-28 10:43:04,621 INFO L290 TraceCheckUtils]: 53: Hoare triple {1577#false} ~cond := #in~cond; {1577#false} is VALID [2022-04-28 10:43:04,621 INFO L290 TraceCheckUtils]: 54: Hoare triple {1577#false} assume 0 == ~cond; {1577#false} is VALID [2022-04-28 10:43:04,621 INFO L290 TraceCheckUtils]: 55: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-28 10:43:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:43:04,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:43:04,947 INFO L290 TraceCheckUtils]: 55: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-28 10:43:04,947 INFO L290 TraceCheckUtils]: 54: Hoare triple {1577#false} assume 0 == ~cond; {1577#false} is VALID [2022-04-28 10:43:04,947 INFO L290 TraceCheckUtils]: 53: Hoare triple {1577#false} ~cond := #in~cond; {1577#false} is VALID [2022-04-28 10:43:04,948 INFO L272 TraceCheckUtils]: 52: Hoare triple {1577#false} call __VERIFIER_assert((if ~a~1 == #t~mem35 then 1 else 0)); {1577#false} is VALID [2022-04-28 10:43:04,948 INFO L290 TraceCheckUtils]: 51: Hoare triple {1577#false} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;call #t~mem35 := read~int(~x~0.base, ~x~0.offset, 4); {1577#false} is VALID [2022-04-28 10:43:04,948 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1576#true} {1577#false} #159#return; {1577#false} is VALID [2022-04-28 10:43:04,948 INFO L290 TraceCheckUtils]: 49: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1576#true} is VALID [2022-04-28 10:43:04,948 INFO L290 TraceCheckUtils]: 47: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1576#true} is VALID [2022-04-28 10:43:04,948 INFO L272 TraceCheckUtils]: 46: Hoare triple {1577#false} call #t~ret34 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {1576#true} is VALID [2022-04-28 10:43:04,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {1577#false} ~x~0.base, ~x~0.offset := #t~malloc33.base, #t~malloc33.offset; {1577#false} is VALID [2022-04-28 10:43:04,948 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1576#true} {1577#false} #157#return; {1577#false} is VALID [2022-04-28 10:43:04,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {1576#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1576#true} is VALID [2022-04-28 10:43:04,949 INFO L272 TraceCheckUtils]: 41: Hoare triple {1577#false} call #Ultimate.meminit(#t~malloc33.base, #t~malloc33.offset, ~n~1, 4, 4 * ~n~1); {1576#true} is VALID [2022-04-28 10:43:04,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {1577#false} call #t~malloc33.base, #t~malloc33.offset := #Ultimate.allocOnHeap(4 * ~n~1); {1577#false} is VALID [2022-04-28 10:43:04,949 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1576#true} {1577#false} #155#return; {1577#false} is VALID [2022-04-28 10:43:04,949 INFO L290 TraceCheckUtils]: 38: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-28 10:43:04,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-28 10:43:04,949 INFO L272 TraceCheckUtils]: 35: Hoare triple {1577#false} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {1576#true} is VALID [2022-04-28 10:43:04,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {1577#false} assume -2147483648 <= #t~ret32 && #t~ret32 <= 2147483647;~n~1 := #t~ret32;havoc #t~ret32; {1577#false} is VALID [2022-04-28 10:43:04,950 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} #153#return; {1577#false} is VALID [2022-04-28 10:43:04,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume true; {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;#res := 1 + (#t~ret28 + #t~ret30);havoc #t~mem27.base, #t~mem27.offset;havoc #t~ret28;havoc #t~mem29.base, #t~mem29.offset;havoc #t~ret30; {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,951 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1576#true} {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} #179#return; {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-28 10:43:04,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-28 10:43:04,951 INFO L272 TraceCheckUtils]: 26: Hoare triple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} call #t~ret30 := size(#t~mem29.base, #t~mem29.offset); {1576#true} is VALID [2022-04-28 10:43:04,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;call #t~mem29.base, #t~mem29.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,954 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1576#true} {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} #177#return; {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-28 10:43:04,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-28 10:43:04,955 INFO L272 TraceCheckUtils]: 20: Hoare triple {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} call #t~ret28 := size(#t~mem27.base, #t~mem27.offset); {1576#true} is VALID [2022-04-28 10:43:04,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {1914#(or (not (= |size_#in~t.offset| 0)) (and (= size_~t.offset 0) (= size_~t.base 0)) (not (= |size_#in~t.base| 0)))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1914#(or (not (= |size_#in~t.offset| 0)) (and (= size_~t.offset 0) (= size_~t.base 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-28 10:43:04,957 INFO L272 TraceCheckUtils]: 17: Hoare triple {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} call #t~ret32 := size(~t.base, ~t.offset); {1576#true} is VALID [2022-04-28 10:43:04,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;~a~1 := #t~ret31;havoc #t~ret31;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-28 10:43:04,958 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1576#true} {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} #151#return; {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-28 10:43:04,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1576#true} is VALID [2022-04-28 10:43:04,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {1576#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1576#true} is VALID [2022-04-28 10:43:04,958 INFO L272 TraceCheckUtils]: 11: Hoare triple {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} call #t~ret31 := min(~t.base, ~t.offset); {1576#true} is VALID [2022-04-28 10:43:04,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1586#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-28 10:43:04,959 INFO L272 TraceCheckUtils]: 9: Hoare triple {1584#(and (= |main_#t~ret44.offset| 0) (= |main_#t~ret44.base| 0))} call task(#t~ret44.base, #t~ret44.offset); {1585#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} is VALID [2022-04-28 10:43:04,962 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1620#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} {1576#true} #139#return; {1584#(and (= |main_#t~ret44.offset| 0) (= |main_#t~ret44.base| 0))} is VALID [2022-04-28 10:43:04,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {1620#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1620#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-04-28 10:43:04,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {1576#true} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {1620#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-04-28 10:43:04,963 INFO L272 TraceCheckUtils]: 5: Hoare triple {1576#true} call #t~ret44.base, #t~ret44.offset := nondet_tree(); {1576#true} is VALID [2022-04-28 10:43:04,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret45 := main(); {1576#true} is VALID [2022-04-28 10:43:04,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #181#return; {1576#true} is VALID [2022-04-28 10:43:04,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 10:43:04,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#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(26, 2);call #Ultimate.allocInit(12, 3); {1576#true} is VALID [2022-04-28 10:43:04,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-28 10:43:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:43:04,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225910264] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:43:04,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:43:04,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 15 [2022-04-28 10:43:04,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:04,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1215939782] [2022-04-28 10:43:04,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1215939782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:04,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:04,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:43:04,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109859164] [2022-04-28 10:43:04,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:04,965 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 56 [2022-04-28 10:43:04,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:04,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 10:43:04,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:04,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:43:04,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:04,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:43:04,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:43:04,999 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 10:43:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:07,180 INFO L93 Difference]: Finished difference Result 164 states and 209 transitions. [2022-04-28 10:43:07,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:43:07,180 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 56 [2022-04-28 10:43:07,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 10:43:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2022-04-28 10:43:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 10:43:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2022-04-28 10:43:07,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 205 transitions. [2022-04-28 10:43:07,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:07,393 INFO L225 Difference]: With dead ends: 164 [2022-04-28 10:43:07,394 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 10:43:07,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:43:07,395 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 175 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:07,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 84 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:43:07,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 10:43:07,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2022-04-28 10:43:07,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:07,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-04-28 10:43:07,422 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-04-28 10:43:07,422 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-04-28 10:43:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:07,426 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2022-04-28 10:43:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2022-04-28 10:43:07,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:07,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:07,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) Second operand 96 states. [2022-04-28 10:43:07,427 INFO L87 Difference]: Start difference. First operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) Second operand 96 states. [2022-04-28 10:43:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:07,431 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2022-04-28 10:43:07,431 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2022-04-28 10:43:07,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:07,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:07,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:07,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-04-28 10:43:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2022-04-28 10:43:07,435 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 56 [2022-04-28 10:43:07,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:07,436 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2022-04-28 10:43:07,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 10:43:07,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 116 transitions. [2022-04-28 10:43:07,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:07,548 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2022-04-28 10:43:07,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 10:43:07,549 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:07,549 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:07,568 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-04-28 10:43:07,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:07,760 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:07,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash 921875361, now seen corresponding path program 1 times [2022-04-28 10:43:07,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:07,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [921774236] [2022-04-28 10:43:07,761 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:43:07,761 INFO L85 PathProgramCache]: Analyzing trace with hash 921875361, now seen corresponding path program 2 times [2022-04-28 10:43:07,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:07,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473326797] [2022-04-28 10:43:07,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:07,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:07,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:43:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:07,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {2747#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(26, 2);call #Ultimate.allocInit(12, 3); {2695#true} is VALID [2022-04-28 10:43:07,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,817 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2695#true} {2695#true} #181#return; {2695#true} is VALID [2022-04-28 10:43:07,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-28 10:43:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:07,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-28 10:43:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:07,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {2748#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {2695#true} is VALID [2022-04-28 10:43:07,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2695#true} {2749#(not (= nondet_tree_~n~0.base 0))} #147#return; {2749#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:07,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:43:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:07,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {2748#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {2695#true} is VALID [2022-04-28 10:43:07,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2695#true} {2749#(not (= nondet_tree_~n~0.base 0))} #149#return; {2749#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:07,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {2748#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume !(0 != #t~nondet5 % 256);havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(20);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet7; {2749#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:07,868 INFO L272 TraceCheckUtils]: 1: Hoare triple {2749#(not (= nondet_tree_~n~0.base 0))} call #t~ret8.base, #t~ret8.offset := nondet_tree(); {2748#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 10:43:07,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {2748#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {2695#true} is VALID [2022-04-28 10:43:07,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,869 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2695#true} {2749#(not (= nondet_tree_~n~0.base 0))} #147#return; {2749#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:07,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {2749#(not (= nondet_tree_~n~0.base 0))} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~n~0.base, 4 + ~n~0.offset, 8);havoc #t~ret8.base, #t~ret8.offset; {2749#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:07,870 INFO L272 TraceCheckUtils]: 6: Hoare triple {2749#(not (= nondet_tree_~n~0.base 0))} call #t~ret9.base, #t~ret9.offset := nondet_tree(); {2748#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 10:43:07,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {2748#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {2695#true} is VALID [2022-04-28 10:43:07,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,871 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2695#true} {2749#(not (= nondet_tree_~n~0.base 0))} #149#return; {2749#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:07,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {2749#(not (= nondet_tree_~n~0.base 0))} call write~$Pointer$(#t~ret9.base, #t~ret9.offset, ~n~0.base, 12 + ~n~0.offset, 8);havoc #t~ret9.base, #t~ret9.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2756#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-28 10:43:07,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {2756#(not (= |nondet_tree_#res.base| 0))} assume true; {2756#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-28 10:43:07,872 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2756#(not (= |nondet_tree_#res.base| 0))} {2695#true} #139#return; {2713#(not (= |main_#t~ret44.base| 0))} is VALID [2022-04-28 10:43:07,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 10:43:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:07,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2757#(= min_~n.base |min_#in~n.base|)} is VALID [2022-04-28 10:43:07,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {2757#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2758#(= |min_#in~n.base| 0)} is VALID [2022-04-28 10:43:07,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {2758#(= |min_#in~n.base| 0)} assume true; {2758#(= |min_#in~n.base| 0)} is VALID [2022-04-28 10:43:07,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2758#(= |min_#in~n.base| 0)} {2715#(not (= task_~t.base 0))} #151#return; {2696#false} is VALID [2022-04-28 10:43:07,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-28 10:43:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:07,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-28 10:43:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:07,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2695#true} is VALID [2022-04-28 10:43:07,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2695#true} is VALID [2022-04-28 10:43:07,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2695#true} {2695#true} #177#return; {2695#true} is VALID [2022-04-28 10:43:07,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-28 10:43:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:07,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2695#true} is VALID [2022-04-28 10:43:07,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2695#true} is VALID [2022-04-28 10:43:07,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2695#true} {2695#true} #179#return; {2695#true} is VALID [2022-04-28 10:43:07,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2695#true} is VALID [2022-04-28 10:43:07,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {2695#true} is VALID [2022-04-28 10:43:07,928 INFO L272 TraceCheckUtils]: 2: Hoare triple {2695#true} call #t~ret28 := size(#t~mem27.base, #t~mem27.offset); {2695#true} is VALID [2022-04-28 10:43:07,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {2695#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2695#true} is VALID [2022-04-28 10:43:07,928 INFO L290 TraceCheckUtils]: 4: Hoare triple {2695#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2695#true} is VALID [2022-04-28 10:43:07,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,928 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2695#true} {2695#true} #177#return; {2695#true} is VALID [2022-04-28 10:43:07,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {2695#true} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;call #t~mem29.base, #t~mem29.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {2695#true} is VALID [2022-04-28 10:43:07,928 INFO L272 TraceCheckUtils]: 8: Hoare triple {2695#true} call #t~ret30 := size(#t~mem29.base, #t~mem29.offset); {2695#true} is VALID [2022-04-28 10:43:07,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {2695#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2695#true} is VALID [2022-04-28 10:43:07,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {2695#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2695#true} is VALID [2022-04-28 10:43:07,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,928 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2695#true} {2695#true} #179#return; {2695#true} is VALID [2022-04-28 10:43:07,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {2695#true} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;#res := 1 + (#t~ret28 + #t~ret30);havoc #t~mem27.base, #t~mem27.offset;havoc #t~ret28;havoc #t~mem29.base, #t~mem29.offset;havoc #t~ret30; {2695#true} is VALID [2022-04-28 10:43:07,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,929 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2695#true} {2696#false} #153#return; {2696#false} is VALID [2022-04-28 10:43:07,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-28 10:43:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:07,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#true} ~cond := #in~cond; {2695#true} is VALID [2022-04-28 10:43:07,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume !(0 == ~cond); {2695#true} is VALID [2022-04-28 10:43:07,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2695#true} {2696#false} #155#return; {2696#false} is VALID [2022-04-28 10:43:07,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-28 10:43:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:07,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {2767#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2695#true} is VALID [2022-04-28 10:43:07,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2695#true} {2696#false} #157#return; {2696#false} is VALID [2022-04-28 10:43:07,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-28 10:43:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:07,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {2768#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2695#true} is VALID [2022-04-28 10:43:07,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2695#true} is VALID [2022-04-28 10:43:07,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2695#true} {2696#false} #159#return; {2696#false} is VALID [2022-04-28 10:43:07,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {2695#true} call ULTIMATE.init(); {2747#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:43:07,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {2747#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(26, 2);call #Ultimate.allocInit(12, 3); {2695#true} is VALID [2022-04-28 10:43:07,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2695#true} {2695#true} #181#return; {2695#true} is VALID [2022-04-28 10:43:07,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {2695#true} call #t~ret45 := main(); {2695#true} is VALID [2022-04-28 10:43:07,960 INFO L272 TraceCheckUtils]: 5: Hoare triple {2695#true} call #t~ret44.base, #t~ret44.offset := nondet_tree(); {2748#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 10:43:07,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {2748#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume !(0 != #t~nondet5 % 256);havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(20);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet7; {2749#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:07,961 INFO L272 TraceCheckUtils]: 7: Hoare triple {2749#(not (= nondet_tree_~n~0.base 0))} call #t~ret8.base, #t~ret8.offset := nondet_tree(); {2748#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 10:43:07,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {2748#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {2695#true} is VALID [2022-04-28 10:43:07,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,962 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2695#true} {2749#(not (= nondet_tree_~n~0.base 0))} #147#return; {2749#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:07,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {2749#(not (= nondet_tree_~n~0.base 0))} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~n~0.base, 4 + ~n~0.offset, 8);havoc #t~ret8.base, #t~ret8.offset; {2749#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:07,962 INFO L272 TraceCheckUtils]: 12: Hoare triple {2749#(not (= nondet_tree_~n~0.base 0))} call #t~ret9.base, #t~ret9.offset := nondet_tree(); {2748#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 10:43:07,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {2748#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {2695#true} is VALID [2022-04-28 10:43:07,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,963 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2695#true} {2749#(not (= nondet_tree_~n~0.base 0))} #149#return; {2749#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:07,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {2749#(not (= nondet_tree_~n~0.base 0))} call write~$Pointer$(#t~ret9.base, #t~ret9.offset, ~n~0.base, 12 + ~n~0.offset, 8);havoc #t~ret9.base, #t~ret9.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2756#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-28 10:43:07,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {2756#(not (= |nondet_tree_#res.base| 0))} assume true; {2756#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-28 10:43:07,964 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2756#(not (= |nondet_tree_#res.base| 0))} {2695#true} #139#return; {2713#(not (= |main_#t~ret44.base| 0))} is VALID [2022-04-28 10:43:07,965 INFO L272 TraceCheckUtils]: 19: Hoare triple {2713#(not (= |main_#t~ret44.base| 0))} call task(#t~ret44.base, #t~ret44.offset); {2714#(not (= |task_#in~t.base| 0))} is VALID [2022-04-28 10:43:07,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {2714#(not (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2715#(not (= task_~t.base 0))} is VALID [2022-04-28 10:43:07,965 INFO L272 TraceCheckUtils]: 21: Hoare triple {2715#(not (= task_~t.base 0))} call #t~ret31 := min(~t.base, ~t.offset); {2695#true} is VALID [2022-04-28 10:43:07,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {2695#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2757#(= min_~n.base |min_#in~n.base|)} is VALID [2022-04-28 10:43:07,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {2757#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2758#(= |min_#in~n.base| 0)} is VALID [2022-04-28 10:43:07,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {2758#(= |min_#in~n.base| 0)} assume true; {2758#(= |min_#in~n.base| 0)} is VALID [2022-04-28 10:43:07,966 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2758#(= |min_#in~n.base| 0)} {2715#(not (= task_~t.base 0))} #151#return; {2696#false} is VALID [2022-04-28 10:43:07,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {2696#false} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;~a~1 := #t~ret31;havoc #t~ret31;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2696#false} is VALID [2022-04-28 10:43:07,966 INFO L272 TraceCheckUtils]: 27: Hoare triple {2696#false} call #t~ret32 := size(~t.base, ~t.offset); {2695#true} is VALID [2022-04-28 10:43:07,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {2695#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2695#true} is VALID [2022-04-28 10:43:07,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {2695#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {2695#true} is VALID [2022-04-28 10:43:07,967 INFO L272 TraceCheckUtils]: 30: Hoare triple {2695#true} call #t~ret28 := size(#t~mem27.base, #t~mem27.offset); {2695#true} is VALID [2022-04-28 10:43:07,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {2695#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2695#true} is VALID [2022-04-28 10:43:07,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {2695#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2695#true} is VALID [2022-04-28 10:43:07,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,967 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2695#true} {2695#true} #177#return; {2695#true} is VALID [2022-04-28 10:43:07,967 INFO L290 TraceCheckUtils]: 35: Hoare triple {2695#true} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;call #t~mem29.base, #t~mem29.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {2695#true} is VALID [2022-04-28 10:43:07,967 INFO L272 TraceCheckUtils]: 36: Hoare triple {2695#true} call #t~ret30 := size(#t~mem29.base, #t~mem29.offset); {2695#true} is VALID [2022-04-28 10:43:07,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {2695#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2695#true} is VALID [2022-04-28 10:43:07,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {2695#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2695#true} is VALID [2022-04-28 10:43:07,967 INFO L290 TraceCheckUtils]: 39: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,967 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2695#true} {2695#true} #179#return; {2695#true} is VALID [2022-04-28 10:43:07,967 INFO L290 TraceCheckUtils]: 41: Hoare triple {2695#true} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;#res := 1 + (#t~ret28 + #t~ret30);havoc #t~mem27.base, #t~mem27.offset;havoc #t~ret28;havoc #t~mem29.base, #t~mem29.offset;havoc #t~ret30; {2695#true} is VALID [2022-04-28 10:43:07,967 INFO L290 TraceCheckUtils]: 42: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,967 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2695#true} {2696#false} #153#return; {2696#false} is VALID [2022-04-28 10:43:07,968 INFO L290 TraceCheckUtils]: 44: Hoare triple {2696#false} assume -2147483648 <= #t~ret32 && #t~ret32 <= 2147483647;~n~1 := #t~ret32;havoc #t~ret32; {2696#false} is VALID [2022-04-28 10:43:07,968 INFO L272 TraceCheckUtils]: 45: Hoare triple {2696#false} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {2695#true} is VALID [2022-04-28 10:43:07,968 INFO L290 TraceCheckUtils]: 46: Hoare triple {2695#true} ~cond := #in~cond; {2695#true} is VALID [2022-04-28 10:43:07,968 INFO L290 TraceCheckUtils]: 47: Hoare triple {2695#true} assume !(0 == ~cond); {2695#true} is VALID [2022-04-28 10:43:07,968 INFO L290 TraceCheckUtils]: 48: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,968 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2695#true} {2696#false} #155#return; {2696#false} is VALID [2022-04-28 10:43:07,968 INFO L290 TraceCheckUtils]: 50: Hoare triple {2696#false} call #t~malloc33.base, #t~malloc33.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2696#false} is VALID [2022-04-28 10:43:07,968 INFO L272 TraceCheckUtils]: 51: Hoare triple {2696#false} call #Ultimate.meminit(#t~malloc33.base, #t~malloc33.offset, ~n~1, 4, 4 * ~n~1); {2767#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:43:07,968 INFO L290 TraceCheckUtils]: 52: Hoare triple {2767#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2695#true} is VALID [2022-04-28 10:43:07,968 INFO L290 TraceCheckUtils]: 53: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,968 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {2695#true} {2696#false} #157#return; {2696#false} is VALID [2022-04-28 10:43:07,968 INFO L290 TraceCheckUtils]: 55: Hoare triple {2696#false} ~x~0.base, ~x~0.offset := #t~malloc33.base, #t~malloc33.offset; {2696#false} is VALID [2022-04-28 10:43:07,968 INFO L272 TraceCheckUtils]: 56: Hoare triple {2696#false} call #t~ret34 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2768#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 10:43:07,968 INFO L290 TraceCheckUtils]: 57: Hoare triple {2768#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2695#true} is VALID [2022-04-28 10:43:07,968 INFO L290 TraceCheckUtils]: 58: Hoare triple {2695#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2695#true} is VALID [2022-04-28 10:43:07,968 INFO L290 TraceCheckUtils]: 59: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-28 10:43:07,968 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2695#true} {2696#false} #159#return; {2696#false} is VALID [2022-04-28 10:43:07,969 INFO L290 TraceCheckUtils]: 61: Hoare triple {2696#false} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;call #t~mem35 := read~int(~x~0.base, ~x~0.offset, 4); {2696#false} is VALID [2022-04-28 10:43:07,969 INFO L272 TraceCheckUtils]: 62: Hoare triple {2696#false} call __VERIFIER_assert((if ~a~1 == #t~mem35 then 1 else 0)); {2696#false} is VALID [2022-04-28 10:43:07,969 INFO L290 TraceCheckUtils]: 63: Hoare triple {2696#false} ~cond := #in~cond; {2696#false} is VALID [2022-04-28 10:43:07,969 INFO L290 TraceCheckUtils]: 64: Hoare triple {2696#false} assume 0 == ~cond; {2696#false} is VALID [2022-04-28 10:43:07,969 INFO L290 TraceCheckUtils]: 65: Hoare triple {2696#false} assume !false; {2696#false} is VALID [2022-04-28 10:43:07,969 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 10:43:07,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:07,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473326797] [2022-04-28 10:43:07,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473326797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:07,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:07,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:43:07,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:07,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [921774236] [2022-04-28 10:43:07,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [921774236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:07,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:07,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:43:07,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295700784] [2022-04-28 10:43:07,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:07,970 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 66 [2022-04-28 10:43:07,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:07,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 10:43:08,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:08,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:43:08,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:08,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:43:08,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:43:08,008 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 10:43:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:10,001 INFO L93 Difference]: Finished difference Result 163 states and 208 transitions. [2022-04-28 10:43:10,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:43:10,001 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 66 [2022-04-28 10:43:10,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 10:43:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 200 transitions. [2022-04-28 10:43:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 10:43:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 200 transitions. [2022-04-28 10:43:10,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 200 transitions. [2022-04-28 10:43:10,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:10,194 INFO L225 Difference]: With dead ends: 163 [2022-04-28 10:43:10,194 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 10:43:10,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:43:10,195 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 168 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:10,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 82 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:43:10,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 10:43:10,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2022-04-28 10:43:10,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:10,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2022-04-28 10:43:10,207 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2022-04-28 10:43:10,207 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2022-04-28 10:43:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:10,210 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2022-04-28 10:43:10,210 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2022-04-28 10:43:10,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:10,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:10,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) Second operand 98 states. [2022-04-28 10:43:10,211 INFO L87 Difference]: Start difference. First operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) Second operand 98 states. [2022-04-28 10:43:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:10,214 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2022-04-28 10:43:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2022-04-28 10:43:10,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:10,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:10,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:10,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2022-04-28 10:43:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2022-04-28 10:43:10,217 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 66 [2022-04-28 10:43:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:10,218 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2022-04-28 10:43:10,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 10:43:10,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 119 transitions. [2022-04-28 10:43:10,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2022-04-28 10:43:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 10:43:10,342 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:10,343 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:10,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 10:43:10,343 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:10,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:10,344 INFO L85 PathProgramCache]: Analyzing trace with hash 940648973, now seen corresponding path program 1 times [2022-04-28 10:43:10,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:10,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1077065491] [2022-04-28 10:43:10,344 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:43:10,344 INFO L85 PathProgramCache]: Analyzing trace with hash 940648973, now seen corresponding path program 2 times [2022-04-28 10:43:10,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:10,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028992728] [2022-04-28 10:43:10,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:10,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:10,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:43:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:10,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {3570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(26, 2);call #Ultimate.allocInit(12, 3); {3505#true} is VALID [2022-04-28 10:43:10,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,440 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3505#true} {3505#true} #181#return; {3505#true} is VALID [2022-04-28 10:43:10,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-28 10:43:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:10,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-28 10:43:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:10,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {3571#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {3505#true} is VALID [2022-04-28 10:43:10,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3505#true} {3572#(not (= nondet_tree_~n~0.base 0))} #147#return; {3572#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:10,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:43:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:10,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {3571#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {3505#true} is VALID [2022-04-28 10:43:10,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,492 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3505#true} {3572#(not (= nondet_tree_~n~0.base 0))} #149#return; {3572#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:10,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {3571#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume !(0 != #t~nondet5 % 256);havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(20);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet7; {3572#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:10,492 INFO L272 TraceCheckUtils]: 1: Hoare triple {3572#(not (= nondet_tree_~n~0.base 0))} call #t~ret8.base, #t~ret8.offset := nondet_tree(); {3571#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 10:43:10,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {3571#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {3505#true} is VALID [2022-04-28 10:43:10,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,493 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3505#true} {3572#(not (= nondet_tree_~n~0.base 0))} #147#return; {3572#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:10,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {3572#(not (= nondet_tree_~n~0.base 0))} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~n~0.base, 4 + ~n~0.offset, 8);havoc #t~ret8.base, #t~ret8.offset; {3572#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:10,494 INFO L272 TraceCheckUtils]: 6: Hoare triple {3572#(not (= nondet_tree_~n~0.base 0))} call #t~ret9.base, #t~ret9.offset := nondet_tree(); {3571#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 10:43:10,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {3571#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {3505#true} is VALID [2022-04-28 10:43:10,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,494 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3505#true} {3572#(not (= nondet_tree_~n~0.base 0))} #149#return; {3572#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:10,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {3572#(not (= nondet_tree_~n~0.base 0))} call write~$Pointer$(#t~ret9.base, #t~ret9.offset, ~n~0.base, 12 + ~n~0.offset, 8);havoc #t~ret9.base, #t~ret9.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {3579#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-28 10:43:10,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {3579#(not (= |nondet_tree_#res.base| 0))} assume true; {3579#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-28 10:43:10,495 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3579#(not (= |nondet_tree_#res.base| 0))} {3505#true} #139#return; {3523#(not (= |main_#t~ret44.base| 0))} is VALID [2022-04-28 10:43:10,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 10:43:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:10,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-28 10:43:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:10,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3505#true} is VALID [2022-04-28 10:43:10,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {3505#true} is VALID [2022-04-28 10:43:10,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3505#true} {3505#true} #143#return; {3505#true} is VALID [2022-04-28 10:43:10,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-28 10:43:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:10,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3505#true} is VALID [2022-04-28 10:43:10,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {3505#true} is VALID [2022-04-28 10:43:10,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3505#true} {3505#true} #145#return; {3505#true} is VALID [2022-04-28 10:43:10,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3505#true} is VALID [2022-04-28 10:43:10,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 8); {3505#true} is VALID [2022-04-28 10:43:10,515 INFO L272 TraceCheckUtils]: 2: Hoare triple {3505#true} call #t~ret11 := min(#t~mem10.base, #t~mem10.offset); {3505#true} is VALID [2022-04-28 10:43:10,515 INFO L290 TraceCheckUtils]: 3: Hoare triple {3505#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3505#true} is VALID [2022-04-28 10:43:10,515 INFO L290 TraceCheckUtils]: 4: Hoare triple {3505#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {3505#true} is VALID [2022-04-28 10:43:10,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,515 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3505#true} {3505#true} #143#return; {3505#true} is VALID [2022-04-28 10:43:10,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {3505#true} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~a~0 := #t~ret11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~ret11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~n.base, 12 + ~n.offset, 8); {3505#true} is VALID [2022-04-28 10:43:10,519 INFO L272 TraceCheckUtils]: 8: Hoare triple {3505#true} call #t~ret13 := min(#t~mem12.base, #t~mem12.offset); {3505#true} is VALID [2022-04-28 10:43:10,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {3505#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3505#true} is VALID [2022-04-28 10:43:10,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {3505#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {3505#true} is VALID [2022-04-28 10:43:10,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,519 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3505#true} {3505#true} #145#return; {3505#true} is VALID [2022-04-28 10:43:10,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {3505#true} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~b~0 := #t~ret13;havoc #t~mem12.base, #t~mem12.offset;havoc #t~ret13; {3505#true} is VALID [2022-04-28 10:43:10,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {3505#true} assume ~a~0 <= ~b~0;#res := ~a~0; {3505#true} is VALID [2022-04-28 10:43:10,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,520 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3505#true} {3525#(not (= task_~t.base 0))} #151#return; {3525#(not (= task_~t.base 0))} is VALID [2022-04-28 10:43:10,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-28 10:43:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:10,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-28 10:43:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:10,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3505#true} is VALID [2022-04-28 10:43:10,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {3505#true} is VALID [2022-04-28 10:43:10,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3505#true} {3505#true} #177#return; {3505#true} is VALID [2022-04-28 10:43:10,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-28 10:43:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:10,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3505#true} is VALID [2022-04-28 10:43:10,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {3505#true} is VALID [2022-04-28 10:43:10,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3505#true} {3505#true} #179#return; {3505#true} is VALID [2022-04-28 10:43:10,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3505#true} is VALID [2022-04-28 10:43:10,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {3505#true} is VALID [2022-04-28 10:43:10,531 INFO L272 TraceCheckUtils]: 2: Hoare triple {3505#true} call #t~ret28 := size(#t~mem27.base, #t~mem27.offset); {3505#true} is VALID [2022-04-28 10:43:10,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {3505#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3505#true} is VALID [2022-04-28 10:43:10,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {3505#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {3505#true} is VALID [2022-04-28 10:43:10,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,532 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3505#true} {3505#true} #177#return; {3505#true} is VALID [2022-04-28 10:43:10,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {3505#true} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;call #t~mem29.base, #t~mem29.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {3505#true} is VALID [2022-04-28 10:43:10,532 INFO L272 TraceCheckUtils]: 8: Hoare triple {3505#true} call #t~ret30 := size(#t~mem29.base, #t~mem29.offset); {3505#true} is VALID [2022-04-28 10:43:10,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {3505#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3505#true} is VALID [2022-04-28 10:43:10,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {3505#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {3505#true} is VALID [2022-04-28 10:43:10,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,532 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3505#true} {3505#true} #179#return; {3505#true} is VALID [2022-04-28 10:43:10,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {3505#true} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;#res := 1 + (#t~ret28 + #t~ret30);havoc #t~mem27.base, #t~mem27.offset;havoc #t~ret28;havoc #t~mem29.base, #t~mem29.offset;havoc #t~ret30; {3505#true} is VALID [2022-04-28 10:43:10,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,532 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3505#true} {3525#(not (= task_~t.base 0))} #153#return; {3525#(not (= task_~t.base 0))} is VALID [2022-04-28 10:43:10,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-28 10:43:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:10,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} ~cond := #in~cond; {3505#true} is VALID [2022-04-28 10:43:10,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume !(0 == ~cond); {3505#true} is VALID [2022-04-28 10:43:10,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3505#true} {3525#(not (= task_~t.base 0))} #155#return; {3525#(not (= task_~t.base 0))} is VALID [2022-04-28 10:43:10,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-28 10:43:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:10,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {3596#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3505#true} is VALID [2022-04-28 10:43:10,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,550 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3505#true} {3525#(not (= task_~t.base 0))} #157#return; {3525#(not (= task_~t.base 0))} is VALID [2022-04-28 10:43:10,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-04-28 10:43:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:10,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {3597#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {3598#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2022-04-28 10:43:10,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {3598#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {3599#(= |tree_inorder_#in~t.base| 0)} is VALID [2022-04-28 10:43:10,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {3599#(= |tree_inorder_#in~t.base| 0)} assume true; {3599#(= |tree_inorder_#in~t.base| 0)} is VALID [2022-04-28 10:43:10,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3599#(= |tree_inorder_#in~t.base| 0)} {3525#(not (= task_~t.base 0))} #159#return; {3506#false} is VALID [2022-04-28 10:43:10,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {3505#true} call ULTIMATE.init(); {3570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:43:10,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {3570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(26, 2);call #Ultimate.allocInit(12, 3); {3505#true} is VALID [2022-04-28 10:43:10,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3505#true} {3505#true} #181#return; {3505#true} is VALID [2022-04-28 10:43:10,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {3505#true} call #t~ret45 := main(); {3505#true} is VALID [2022-04-28 10:43:10,578 INFO L272 TraceCheckUtils]: 5: Hoare triple {3505#true} call #t~ret44.base, #t~ret44.offset := nondet_tree(); {3571#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 10:43:10,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {3571#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume !(0 != #t~nondet5 % 256);havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(20);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet7; {3572#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:10,578 INFO L272 TraceCheckUtils]: 7: Hoare triple {3572#(not (= nondet_tree_~n~0.base 0))} call #t~ret8.base, #t~ret8.offset := nondet_tree(); {3571#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 10:43:10,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {3571#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {3505#true} is VALID [2022-04-28 10:43:10,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,579 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3505#true} {3572#(not (= nondet_tree_~n~0.base 0))} #147#return; {3572#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:10,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {3572#(not (= nondet_tree_~n~0.base 0))} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~n~0.base, 4 + ~n~0.offset, 8);havoc #t~ret8.base, #t~ret8.offset; {3572#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:10,580 INFO L272 TraceCheckUtils]: 12: Hoare triple {3572#(not (= nondet_tree_~n~0.base 0))} call #t~ret9.base, #t~ret9.offset := nondet_tree(); {3571#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 10:43:10,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {3571#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {3505#true} is VALID [2022-04-28 10:43:10,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,580 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3505#true} {3572#(not (= nondet_tree_~n~0.base 0))} #149#return; {3572#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-28 10:43:10,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {3572#(not (= nondet_tree_~n~0.base 0))} call write~$Pointer$(#t~ret9.base, #t~ret9.offset, ~n~0.base, 12 + ~n~0.offset, 8);havoc #t~ret9.base, #t~ret9.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {3579#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-28 10:43:10,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {3579#(not (= |nondet_tree_#res.base| 0))} assume true; {3579#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-28 10:43:10,581 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3579#(not (= |nondet_tree_#res.base| 0))} {3505#true} #139#return; {3523#(not (= |main_#t~ret44.base| 0))} is VALID [2022-04-28 10:43:10,582 INFO L272 TraceCheckUtils]: 19: Hoare triple {3523#(not (= |main_#t~ret44.base| 0))} call task(#t~ret44.base, #t~ret44.offset); {3524#(not (= |task_#in~t.base| 0))} is VALID [2022-04-28 10:43:10,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {3524#(not (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3525#(not (= task_~t.base 0))} is VALID [2022-04-28 10:43:10,582 INFO L272 TraceCheckUtils]: 21: Hoare triple {3525#(not (= task_~t.base 0))} call #t~ret31 := min(~t.base, ~t.offset); {3505#true} is VALID [2022-04-28 10:43:10,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {3505#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3505#true} is VALID [2022-04-28 10:43:10,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {3505#true} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 8); {3505#true} is VALID [2022-04-28 10:43:10,582 INFO L272 TraceCheckUtils]: 24: Hoare triple {3505#true} call #t~ret11 := min(#t~mem10.base, #t~mem10.offset); {3505#true} is VALID [2022-04-28 10:43:10,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {3505#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3505#true} is VALID [2022-04-28 10:43:10,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {3505#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {3505#true} is VALID [2022-04-28 10:43:10,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,582 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3505#true} {3505#true} #143#return; {3505#true} is VALID [2022-04-28 10:43:10,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {3505#true} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~a~0 := #t~ret11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~ret11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~n.base, 12 + ~n.offset, 8); {3505#true} is VALID [2022-04-28 10:43:10,583 INFO L272 TraceCheckUtils]: 30: Hoare triple {3505#true} call #t~ret13 := min(#t~mem12.base, #t~mem12.offset); {3505#true} is VALID [2022-04-28 10:43:10,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {3505#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3505#true} is VALID [2022-04-28 10:43:10,583 INFO L290 TraceCheckUtils]: 32: Hoare triple {3505#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {3505#true} is VALID [2022-04-28 10:43:10,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,583 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3505#true} {3505#true} #145#return; {3505#true} is VALID [2022-04-28 10:43:10,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {3505#true} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~b~0 := #t~ret13;havoc #t~mem12.base, #t~mem12.offset;havoc #t~ret13; {3505#true} is VALID [2022-04-28 10:43:10,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {3505#true} assume ~a~0 <= ~b~0;#res := ~a~0; {3505#true} is VALID [2022-04-28 10:43:10,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,584 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3505#true} {3525#(not (= task_~t.base 0))} #151#return; {3525#(not (= task_~t.base 0))} is VALID [2022-04-28 10:43:10,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {3525#(not (= task_~t.base 0))} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;~a~1 := #t~ret31;havoc #t~ret31;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {3525#(not (= task_~t.base 0))} is VALID [2022-04-28 10:43:10,584 INFO L272 TraceCheckUtils]: 40: Hoare triple {3525#(not (= task_~t.base 0))} call #t~ret32 := size(~t.base, ~t.offset); {3505#true} is VALID [2022-04-28 10:43:10,584 INFO L290 TraceCheckUtils]: 41: Hoare triple {3505#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3505#true} is VALID [2022-04-28 10:43:10,584 INFO L290 TraceCheckUtils]: 42: Hoare triple {3505#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {3505#true} is VALID [2022-04-28 10:43:10,584 INFO L272 TraceCheckUtils]: 43: Hoare triple {3505#true} call #t~ret28 := size(#t~mem27.base, #t~mem27.offset); {3505#true} is VALID [2022-04-28 10:43:10,584 INFO L290 TraceCheckUtils]: 44: Hoare triple {3505#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3505#true} is VALID [2022-04-28 10:43:10,584 INFO L290 TraceCheckUtils]: 45: Hoare triple {3505#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {3505#true} is VALID [2022-04-28 10:43:10,584 INFO L290 TraceCheckUtils]: 46: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,584 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {3505#true} {3505#true} #177#return; {3505#true} is VALID [2022-04-28 10:43:10,584 INFO L290 TraceCheckUtils]: 48: Hoare triple {3505#true} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;call #t~mem29.base, #t~mem29.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {3505#true} is VALID [2022-04-28 10:43:10,584 INFO L272 TraceCheckUtils]: 49: Hoare triple {3505#true} call #t~ret30 := size(#t~mem29.base, #t~mem29.offset); {3505#true} is VALID [2022-04-28 10:43:10,584 INFO L290 TraceCheckUtils]: 50: Hoare triple {3505#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3505#true} is VALID [2022-04-28 10:43:10,584 INFO L290 TraceCheckUtils]: 51: Hoare triple {3505#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {3505#true} is VALID [2022-04-28 10:43:10,585 INFO L290 TraceCheckUtils]: 52: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,585 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3505#true} {3505#true} #179#return; {3505#true} is VALID [2022-04-28 10:43:10,585 INFO L290 TraceCheckUtils]: 54: Hoare triple {3505#true} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;#res := 1 + (#t~ret28 + #t~ret30);havoc #t~mem27.base, #t~mem27.offset;havoc #t~ret28;havoc #t~mem29.base, #t~mem29.offset;havoc #t~ret30; {3505#true} is VALID [2022-04-28 10:43:10,585 INFO L290 TraceCheckUtils]: 55: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,585 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3505#true} {3525#(not (= task_~t.base 0))} #153#return; {3525#(not (= task_~t.base 0))} is VALID [2022-04-28 10:43:10,585 INFO L290 TraceCheckUtils]: 57: Hoare triple {3525#(not (= task_~t.base 0))} assume -2147483648 <= #t~ret32 && #t~ret32 <= 2147483647;~n~1 := #t~ret32;havoc #t~ret32; {3525#(not (= task_~t.base 0))} is VALID [2022-04-28 10:43:10,585 INFO L272 TraceCheckUtils]: 58: Hoare triple {3525#(not (= task_~t.base 0))} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {3505#true} is VALID [2022-04-28 10:43:10,585 INFO L290 TraceCheckUtils]: 59: Hoare triple {3505#true} ~cond := #in~cond; {3505#true} is VALID [2022-04-28 10:43:10,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {3505#true} assume !(0 == ~cond); {3505#true} is VALID [2022-04-28 10:43:10,586 INFO L290 TraceCheckUtils]: 61: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,586 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {3505#true} {3525#(not (= task_~t.base 0))} #155#return; {3525#(not (= task_~t.base 0))} is VALID [2022-04-28 10:43:10,586 INFO L290 TraceCheckUtils]: 63: Hoare triple {3525#(not (= task_~t.base 0))} call #t~malloc33.base, #t~malloc33.offset := #Ultimate.allocOnHeap(4 * ~n~1); {3525#(not (= task_~t.base 0))} is VALID [2022-04-28 10:43:10,587 INFO L272 TraceCheckUtils]: 64: Hoare triple {3525#(not (= task_~t.base 0))} call #Ultimate.meminit(#t~malloc33.base, #t~malloc33.offset, ~n~1, 4, 4 * ~n~1); {3596#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 10:43:10,587 INFO L290 TraceCheckUtils]: 65: Hoare triple {3596#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3505#true} is VALID [2022-04-28 10:43:10,587 INFO L290 TraceCheckUtils]: 66: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-28 10:43:10,587 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {3505#true} {3525#(not (= task_~t.base 0))} #157#return; {3525#(not (= task_~t.base 0))} is VALID [2022-04-28 10:43:10,588 INFO L290 TraceCheckUtils]: 68: Hoare triple {3525#(not (= task_~t.base 0))} ~x~0.base, ~x~0.offset := #t~malloc33.base, #t~malloc33.offset; {3525#(not (= task_~t.base 0))} is VALID [2022-04-28 10:43:10,588 INFO L272 TraceCheckUtils]: 69: Hoare triple {3525#(not (= task_~t.base 0))} call #t~ret34 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {3597#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 10:43:10,588 INFO L290 TraceCheckUtils]: 70: Hoare triple {3597#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {3598#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2022-04-28 10:43:10,589 INFO L290 TraceCheckUtils]: 71: Hoare triple {3598#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {3599#(= |tree_inorder_#in~t.base| 0)} is VALID [2022-04-28 10:43:10,589 INFO L290 TraceCheckUtils]: 72: Hoare triple {3599#(= |tree_inorder_#in~t.base| 0)} assume true; {3599#(= |tree_inorder_#in~t.base| 0)} is VALID [2022-04-28 10:43:10,590 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3599#(= |tree_inorder_#in~t.base| 0)} {3525#(not (= task_~t.base 0))} #159#return; {3506#false} is VALID [2022-04-28 10:43:10,590 INFO L290 TraceCheckUtils]: 74: Hoare triple {3506#false} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;call #t~mem35 := read~int(~x~0.base, ~x~0.offset, 4); {3506#false} is VALID [2022-04-28 10:43:10,590 INFO L272 TraceCheckUtils]: 75: Hoare triple {3506#false} call __VERIFIER_assert((if ~a~1 == #t~mem35 then 1 else 0)); {3506#false} is VALID [2022-04-28 10:43:10,590 INFO L290 TraceCheckUtils]: 76: Hoare triple {3506#false} ~cond := #in~cond; {3506#false} is VALID [2022-04-28 10:43:10,590 INFO L290 TraceCheckUtils]: 77: Hoare triple {3506#false} assume 0 == ~cond; {3506#false} is VALID [2022-04-28 10:43:10,590 INFO L290 TraceCheckUtils]: 78: Hoare triple {3506#false} assume !false; {3506#false} is VALID [2022-04-28 10:43:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:43:10,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:10,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028992728] [2022-04-28 10:43:10,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028992728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:10,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:10,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:43:10,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:10,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1077065491] [2022-04-28 10:43:10,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1077065491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:10,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:10,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:43:10,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926785951] [2022-04-28 10:43:10,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:10,592 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 79 [2022-04-28 10:43:10,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:10,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 10:43:10,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:10,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:43:10,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:10,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:43:10,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:43:10,632 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 10:43:12,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:12,554 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2022-04-28 10:43:12,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:43:12,555 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 79 [2022-04-28 10:43:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 10:43:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 181 transitions. [2022-04-28 10:43:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 10:43:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 181 transitions. [2022-04-28 10:43:12,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 181 transitions. [2022-04-28 10:43:12,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:12,710 INFO L225 Difference]: With dead ends: 151 [2022-04-28 10:43:12,710 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 10:43:12,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:43:12,712 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 126 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:12,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 82 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:43:12,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 10:43:12,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-04-28 10:43:12,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:12,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2022-04-28 10:43:12,734 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2022-04-28 10:43:12,735 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2022-04-28 10:43:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:12,737 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2022-04-28 10:43:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2022-04-28 10:43:12,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:12,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:12,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) Second operand 98 states. [2022-04-28 10:43:12,738 INFO L87 Difference]: Start difference. First operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) Second operand 98 states. [2022-04-28 10:43:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:12,741 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2022-04-28 10:43:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2022-04-28 10:43:12,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:12,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:12,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:12,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2022-04-28 10:43:12,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2022-04-28 10:43:12,744 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 79 [2022-04-28 10:43:12,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:12,744 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2022-04-28 10:43:12,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 10:43:12,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 123 transitions. [2022-04-28 10:43:12,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2022-04-28 10:43:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 10:43:12,866 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:12,866 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:12,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 10:43:12,866 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:12,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:12,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1677199096, now seen corresponding path program 1 times [2022-04-28 10:43:12,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:12,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [356691218] [2022-04-28 10:43:12,867 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:43:12,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1677199096, now seen corresponding path program 2 times [2022-04-28 10:43:12,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:12,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449783520] [2022-04-28 10:43:12,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:12,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 10:43:12,921 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 10:43:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 10:43:12,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 10:43:12,970 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 10:43:12,970 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 10:43:12,972 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:43:12,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 10:43:12,975 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2] [2022-04-28 10:43:12,977 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: tree_delENTRY has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: minENTRY has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: taskENTRY has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: sizeENTRY has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: tree_inorderENTRY has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: nondet_treeFINAL has no Hoare annotation [2022-04-28 10:43:12,988 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: minFINAL has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-28 10:43:12,989 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: sizeFINAL has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: tree_inorderFINAL has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: tree_delFINAL has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 10:43:12,990 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: tree_delEXIT has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L79-3 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L79-2 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L79-2 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-28 10:43:12,991 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L100-3 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L100-3 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L100-3 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L100-2 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L100-4 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: taskFINAL has no Hoare annotation [2022-04-28 10:43:12,992 WARN L170 areAnnotationChecker]: taskEXIT has no Hoare annotation [2022-04-28 10:43:12,992 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:43:12,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:43:12 BoogieIcfgContainer [2022-04-28 10:43:12,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:43:12,997 INFO L158 Benchmark]: Toolchain (without parser) took 13769.68ms. Allocated memory was 174.1MB in the beginning and 257.9MB in the end (delta: 83.9MB). Free memory was 123.2MB in the beginning and 91.5MB in the end (delta: 31.7MB). Peak memory consumption was 115.7MB. Max. memory is 8.0GB. [2022-04-28 10:43:12,997 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 174.1MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:43:12,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.10ms. Allocated memory is still 174.1MB. Free memory was 122.8MB in the beginning and 146.8MB in the end (delta: -24.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 10:43:12,999 INFO L158 Benchmark]: Boogie Preprocessor took 48.75ms. Allocated memory is still 174.1MB. Free memory was 146.8MB in the beginning and 143.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-28 10:43:12,999 INFO L158 Benchmark]: RCFGBuilder took 475.65ms. Allocated memory is still 174.1MB. Free memory was 143.7MB in the beginning and 121.1MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-04-28 10:43:12,999 INFO L158 Benchmark]: TraceAbstraction took 13033.62ms. Allocated memory was 174.1MB in the beginning and 257.9MB in the end (delta: 83.9MB). Free memory was 120.6MB in the beginning and 91.5MB in the end (delta: 29.1MB). Peak memory consumption was 113.8MB. Max. memory is 8.0GB. [2022-04-28 10:43:13,000 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 174.1MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.10ms. Allocated memory is still 174.1MB. Free memory was 122.8MB in the beginning and 146.8MB in the end (delta: -24.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.75ms. Allocated memory is still 174.1MB. Free memory was 146.8MB in the beginning and 143.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 475.65ms. Allocated memory is still 174.1MB. Free memory was 143.7MB in the beginning and 121.1MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 13033.62ms. Allocated memory was 174.1MB in the beginning and 257.9MB in the end (delta: 83.9MB). Free memory was 120.6MB in the beginning and 91.5MB in the end (delta: 29.1MB). Peak memory consumption was 113.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L105] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; [L30] RET, EXPR nondet_tree() [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; [L31] RET, EXPR nondet_tree() [L31] n->right = nondet_tree() [L32] return n; [L105] RET, EXPR nondet_tree() [L105] CALL task(nondet_tree()) [L83] CALL, EXPR min(t) [L37] COND FALSE !(!n) [L40] EXPR n->left [L40] CALL, EXPR min(n->left) [L37] COND TRUE !n [L38] return 2147483647; [L40] RET, EXPR min(n->left) [L40] int a = min(n->left); [L41] EXPR n->right [L41] CALL, EXPR min(n->right) [L37] COND TRUE !n [L38] return 2147483647; [L41] RET, EXPR min(n->right) [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; [L83] RET, EXPR min(t) [L83] int a = min(t); [L84] int b; [L86] CALL, EXPR size(t) [L78] COND FALSE !(!t) [L79] EXPR t->left [L79] CALL, EXPR size(t->left) [L78] COND TRUE !t [L78] return 0; [L79] RET, EXPR size(t->left) [L79] EXPR t->right [L79] CALL, EXPR size(t->right) [L78] COND TRUE !t [L78] return 0; [L79] RET, EXPR size(t->right) [L79] return size(t->left) + size(t->right) + 1; [L86] RET, EXPR size(t) [L86] int n = size(t); [L87] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) [L87] RET assume_abort_if_not(n != 0) [L88] EXPR, FCALL calloc(n, sizeof(int)) [L88] int *x = calloc(n, sizeof(int)); [L89] CALL tree_inorder(t, x, n) [L67] COND FALSE !(!t) [L70] EXPR t->left [L70] CALL, EXPR tree_inorder(t->left, a, i) [L67] COND TRUE !t [L68] return i; [L70] RET, EXPR tree_inorder(t->left, a, i) [L70] i = tree_inorder(t->left, a, i) [L71] EXPR i++ [L71] EXPR t->data [L71] a[i++] = t->data [L72] EXPR t->right [L72] CALL, EXPR tree_inorder(t->right, a, i) [L67] COND TRUE !t [L68] return i; [L72] RET, EXPR tree_inorder(t->right, a, i) [L72] i = tree_inorder(t->right, a, i) [L73] return i; [L89] RET tree_inorder(t, x, n) [L90] EXPR x[0] [L90] CALL __VERIFIER_assert(a == x[0]) [L16] COND TRUE !cond [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 824 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 769 mSDsluCounter, 407 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 752 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3260 IncrementalHoareTripleChecker+Invalid, 4012 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 752 mSolverCounterUnsat, 353 mSDtfsCounter, 3260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 24 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 10:43:13,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...