/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:12:10,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:12:10,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:12:10,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:12:10,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:12:10,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:12:10,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:12:10,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:12:10,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:12:10,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:12:10,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:12:10,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:12:10,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:12:10,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:12:10,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:12:10,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:12:10,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:12:10,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:12:10,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:12:10,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:12:10,681 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:12:10,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:12:10,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:12:10,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:12:10,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:12:10,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:12:10,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:12:10,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:12:10,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:12:10,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:12:10,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:12:10,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:12:10,691 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:12:10,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:12:10,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:12:10,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:12:10,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:12:10,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:12:10,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:12:10,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:12:10,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:12:10,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:12:10,698 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:12:10,706 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:12:10,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:12:10,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:12:10,708 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:12:10,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:12:10,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:12:10,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:12:10,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:12:10,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:12:10,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:12:10,709 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:12:10,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:12:10,710 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:12:10,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:12:10,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:12:10,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:12:10,711 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:12:10,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:12:10,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:12:10,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:12:10,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:12:10,712 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:12:10,712 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:12:10,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:12:10,712 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:12:10,712 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-15 07:12:10,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:12:10,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:12:10,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:12:10,940 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:12:10,940 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:12:10,942 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-15 07:12:11,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4add771/23facfe20ae1435181853dc13d077811/FLAG36654afe7 [2022-04-15 07:12:11,394 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:12:11,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2022-04-15 07:12:11,400 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4add771/23facfe20ae1435181853dc13d077811/FLAG36654afe7 [2022-04-15 07:12:11,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4add771/23facfe20ae1435181853dc13d077811 [2022-04-15 07:12:11,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:12:11,803 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:12:11,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:12:11,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:12:11,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:12:11,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:12:11" (1/1) ... [2022-04-15 07:12:11,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779eeee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:11, skipping insertion in model container [2022-04-15 07:12:11,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:12:11" (1/1) ... [2022-04-15 07:12:11,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:12:11,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:12:11,988 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-15 07:12:12,015 WARN L1550 CHandler]: Possible shadowing of function min [2022-04-15 07:12:12,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:12:12,063 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:12:12,075 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-15 07:12:12,087 WARN L1550 CHandler]: Possible shadowing of function min [2022-04-15 07:12:12,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:12:12,111 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:12:12,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:12 WrapperNode [2022-04-15 07:12:12,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:12:12,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:12:12,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:12:12,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:12:12,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:12" (1/1) ... [2022-04-15 07:12:12,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:12" (1/1) ... [2022-04-15 07:12:12,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:12" (1/1) ... [2022-04-15 07:12:12,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:12" (1/1) ... [2022-04-15 07:12:12,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:12" (1/1) ... [2022-04-15 07:12:12,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:12" (1/1) ... [2022-04-15 07:12:12,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:12" (1/1) ... [2022-04-15 07:12:12,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:12:12,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:12:12,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:12:12,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:12:12,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:12" (1/1) ... [2022-04-15 07:12:12,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:12:12,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:12:12,209 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-15 07:12:12,214 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-15 07:12:12,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:12:12,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:12:12,248 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:12:12,249 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:12:12,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:12:12,249 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-04-15 07:12:12,250 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-04-15 07:12:12,250 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-04-15 07:12:12,250 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-04-15 07:12:12,251 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-04-15 07:12:12,252 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2022-04-15 07:12:12,252 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:12:12,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 07:12:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 07:12:12,253 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 07:12:12,253 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-15 07:12:12,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:12:12,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 07:12:12,253 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:12:12,254 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:12:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:12:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:12:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:12:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:12:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-04-15 07:12:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 07:12:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:12:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 07:12:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-04-15 07:12:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 07:12:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-04-15 07:12:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:12:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:12:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-04-15 07:12:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-04-15 07:12:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure task [2022-04-15 07:12:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 07:12:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 07:12:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:12:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:12:12,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:12:12,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:12:12,351 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:12:12,353 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:12:12,766 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:12:12,773 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:12:12,773 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 07:12:12,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:12:12 BoogieIcfgContainer [2022-04-15 07:12:12,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:12:12,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:12:12,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:12:12,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:12:12,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:12:11" (1/3) ... [2022-04-15 07:12:12,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdc9a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:12:12, skipping insertion in model container [2022-04-15 07:12:12,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:12" (2/3) ... [2022-04-15 07:12:12,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdc9a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:12:12, skipping insertion in model container [2022-04-15 07:12:12,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:12:12" (3/3) ... [2022-04-15 07:12:12,785 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2022-04-15 07:12:12,789 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:12:12,789 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:12:12,828 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:12:12,836 INFO L340 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 [2022-04-15 07:12:12,836 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:12:12,861 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-15 07:12:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 07:12:12,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:12,871 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:12,872 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:12,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:12,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1536185801, now seen corresponding path program 1 times [2022-04-15 07:12:12,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:12,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1372632294] [2022-04-15 07:12:12,895 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:12:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1536185801, now seen corresponding path program 2 times [2022-04-15 07:12:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:12,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595481753] [2022-04-15 07:12:12,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:12,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:13,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:13,216 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-15 07:12:13,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-15 07:12:13,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {99#true} {99#true} #181#return; {99#true} is VALID [2022-04-15 07:12:13,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 07:12:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:13,254 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-15 07:12:13,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-15 07:12:13,255 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {99#true} {99#true} #139#return; {99#true} is VALID [2022-04-15 07:12:13,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:12:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:13,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {99#true} is VALID [2022-04-15 07:12:13,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {99#true} is VALID [2022-04-15 07:12:13,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-15 07:12:13,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99#true} {99#true} #151#return; {99#true} is VALID [2022-04-15 07:12:13,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 07:12:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:13,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {99#true} is VALID [2022-04-15 07:12:13,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {99#true} is VALID [2022-04-15 07:12:13,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-15 07:12:13,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99#true} {99#true} #153#return; {99#true} is VALID [2022-04-15 07:12:13,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 07:12:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:13,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} ~cond := #in~cond; {99#true} is VALID [2022-04-15 07:12:13,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume 0 == ~cond;assume false; {100#false} is VALID [2022-04-15 07:12:13,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#false} assume true; {100#false} is VALID [2022-04-15 07:12:13,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100#false} {99#true} #155#return; {100#false} is VALID [2022-04-15 07:12:13,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 07:12:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:13,314 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-15 07:12:13,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-15 07:12:13,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {99#true} {100#false} #157#return; {100#false} is VALID [2022-04-15 07:12:13,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 07:12:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:13,343 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-15 07:12:13,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {99#true} is VALID [2022-04-15 07:12:13,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-15 07:12:13,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99#true} {100#false} #159#return; {100#false} is VALID [2022-04-15 07:12:13,348 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-15 07:12:13,348 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-15 07:12:13,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-15 07:12:13,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99#true} {99#true} #181#return; {99#true} is VALID [2022-04-15 07:12:13,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {99#true} call #t~ret45 := main(); {99#true} is VALID [2022-04-15 07:12:13,350 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-15 07:12:13,350 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-15 07:12:13,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-15 07:12:13,351 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {99#true} {99#true} #139#return; {99#true} is VALID [2022-04-15 07:12:13,351 INFO L272 TraceCheckUtils]: 9: Hoare triple {99#true} call task(#t~ret44.base, #t~ret44.offset); {99#true} is VALID [2022-04-15 07:12:13,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {99#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {99#true} is VALID [2022-04-15 07:12:13,351 INFO L272 TraceCheckUtils]: 11: Hoare triple {99#true} call #t~ret31 := min(~t.base, ~t.offset); {99#true} is VALID [2022-04-15 07:12:13,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {99#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {99#true} is VALID [2022-04-15 07:12:13,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {99#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {99#true} is VALID [2022-04-15 07:12:13,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-15 07:12:13,352 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99#true} {99#true} #151#return; {99#true} is VALID [2022-04-15 07:12:13,353 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-15 07:12:13,354 INFO L272 TraceCheckUtils]: 17: Hoare triple {99#true} call #t~ret32 := size(~t.base, ~t.offset); {99#true} is VALID [2022-04-15 07:12:13,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {99#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {99#true} is VALID [2022-04-15 07:12:13,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {99#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {99#true} is VALID [2022-04-15 07:12:13,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-15 07:12:13,363 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {99#true} {99#true} #153#return; {99#true} is VALID [2022-04-15 07:12:13,364 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-15 07:12:13,367 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-15 07:12:13,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {99#true} ~cond := #in~cond; {99#true} is VALID [2022-04-15 07:12:13,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {99#true} assume 0 == ~cond;assume false; {100#false} is VALID [2022-04-15 07:12:13,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {100#false} assume true; {100#false} is VALID [2022-04-15 07:12:13,368 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {100#false} {99#true} #155#return; {100#false} is VALID [2022-04-15 07:12:13,369 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-15 07:12:13,369 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-15 07:12:13,369 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-15 07:12:13,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-15 07:12:13,370 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {99#true} {100#false} #157#return; {100#false} is VALID [2022-04-15 07:12:13,371 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-15 07:12:13,372 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-15 07:12:13,372 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-15 07:12:13,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {99#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {99#true} is VALID [2022-04-15 07:12:13,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {99#true} assume true; {99#true} is VALID [2022-04-15 07:12:13,373 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {99#true} {100#false} #159#return; {100#false} is VALID [2022-04-15 07:12:13,373 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-15 07:12:13,373 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-15 07:12:13,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {100#false} ~cond := #in~cond; {100#false} is VALID [2022-04-15 07:12:13,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {100#false} assume 0 == ~cond; {100#false} is VALID [2022-04-15 07:12:13,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {100#false} assume !false; {100#false} is VALID [2022-04-15 07:12:13,375 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-15 07:12:13,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:13,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595481753] [2022-04-15 07:12:13,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595481753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:13,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:13,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:12:13,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:13,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1372632294] [2022-04-15 07:12:13,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1372632294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:13,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:13,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:12:13,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256122299] [2022-04-15 07:12:13,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:13,390 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-15 07:12:13,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:13,396 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-15 07:12:13,454 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-15 07:12:13,455 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:12:13,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:13,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:12:13,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:12:13,484 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-15 07:12:14,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:14,614 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2022-04-15 07:12:14,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 07:12:14,615 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-15 07:12:14,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:14,617 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-15 07:12:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2022-04-15 07:12:14,632 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-15 07:12:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2022-04-15 07:12:14,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 221 transitions. [2022-04-15 07:12:14,953 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-15 07:12:14,966 INFO L225 Difference]: With dead ends: 168 [2022-04-15 07:12:14,966 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 07:12:14,970 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:12:14,976 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:14,981 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 80 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:12:14,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 07:12:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2022-04-15 07:12:15,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:15,032 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-15 07:12:15,033 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-15 07:12:15,034 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-15 07:12:15,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:15,052 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2022-04-15 07:12:15,052 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2022-04-15 07:12:15,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:15,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:15,056 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-15 07:12:15,060 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-15 07:12:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:15,068 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2022-04-15 07:12:15,069 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2022-04-15 07:12:15,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:15,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:15,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:15,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:15,072 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-15 07:12:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-04-15 07:12:15,080 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 44 [2022-04-15 07:12:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:15,081 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-04-15 07:12:15,081 INFO L479 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-15 07:12:15,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 109 transitions. [2022-04-15 07:12:15,235 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-15 07:12:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-04-15 07:12:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 07:12:15,238 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:15,238 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:15,238 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:12:15,238 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:15,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:15,239 INFO L85 PathProgramCache]: Analyzing trace with hash -152757941, now seen corresponding path program 1 times [2022-04-15 07:12:15,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:15,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [640807021] [2022-04-15 07:12:15,240 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:12:15,240 INFO L85 PathProgramCache]: Analyzing trace with hash -152757941, now seen corresponding path program 2 times [2022-04-15 07:12:15,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:15,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028355168] [2022-04-15 07:12:15,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:15,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:15,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:15,339 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-15 07:12:15,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-15 07:12:15,339 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {840#true} {840#true} #181#return; {840#true} is VALID [2022-04-15 07:12:15,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 07:12:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:15,354 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-15 07:12:15,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-15 07:12:15,355 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {840#true} {840#true} #139#return; {840#true} is VALID [2022-04-15 07:12:15,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:12:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:15,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {840#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {840#true} is VALID [2022-04-15 07:12:15,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {840#true} is VALID [2022-04-15 07:12:15,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-15 07:12:15,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #151#return; {840#true} is VALID [2022-04-15 07:12:15,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 07:12:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:15,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {840#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {840#true} is VALID [2022-04-15 07:12:15,379 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-15 07:12:15,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {871#(= |size_#res| 0)} assume true; {871#(= |size_#res| 0)} is VALID [2022-04-15 07:12:15,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {871#(= |size_#res| 0)} {840#true} #153#return; {856#(= |task_#t~ret32| 0)} is VALID [2022-04-15 07:12:15,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 07:12:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:15,401 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-15 07:12:15,402 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-15 07:12:15,402 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-15 07:12:15,403 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-15 07:12:15,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 07:12:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:15,416 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-15 07:12:15,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-15 07:12:15,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {840#true} {841#false} #157#return; {841#false} is VALID [2022-04-15 07:12:15,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 07:12:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:15,432 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-15 07:12:15,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {840#true} is VALID [2022-04-15 07:12:15,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-15 07:12:15,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {841#false} #159#return; {841#false} is VALID [2022-04-15 07:12:15,433 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-15 07:12:15,434 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-15 07:12:15,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-15 07:12:15,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #181#return; {840#true} is VALID [2022-04-15 07:12:15,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret45 := main(); {840#true} is VALID [2022-04-15 07:12:15,435 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-15 07:12:15,435 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-15 07:12:15,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-15 07:12:15,436 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {840#true} {840#true} #139#return; {840#true} is VALID [2022-04-15 07:12:15,436 INFO L272 TraceCheckUtils]: 9: Hoare triple {840#true} call task(#t~ret44.base, #t~ret44.offset); {840#true} is VALID [2022-04-15 07:12:15,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {840#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {840#true} is VALID [2022-04-15 07:12:15,436 INFO L272 TraceCheckUtils]: 11: Hoare triple {840#true} call #t~ret31 := min(~t.base, ~t.offset); {840#true} is VALID [2022-04-15 07:12:15,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {840#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {840#true} is VALID [2022-04-15 07:12:15,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {840#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {840#true} is VALID [2022-04-15 07:12:15,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-15 07:12:15,437 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {840#true} {840#true} #151#return; {840#true} is VALID [2022-04-15 07:12:15,437 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-15 07:12:15,437 INFO L272 TraceCheckUtils]: 17: Hoare triple {840#true} call #t~ret32 := size(~t.base, ~t.offset); {840#true} is VALID [2022-04-15 07:12:15,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {840#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {840#true} is VALID [2022-04-15 07:12:15,443 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-15 07:12:15,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {871#(= |size_#res| 0)} assume true; {871#(= |size_#res| 0)} is VALID [2022-04-15 07:12:15,445 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {871#(= |size_#res| 0)} {840#true} #153#return; {856#(= |task_#t~ret32| 0)} is VALID [2022-04-15 07:12:15,445 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-15 07:12:15,446 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-15 07:12:15,446 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-15 07:12:15,447 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-15 07:12:15,447 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-15 07:12:15,448 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-15 07:12:15,448 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-15 07:12:15,448 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-15 07:12:15,448 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-15 07:12:15,448 INFO L290 TraceCheckUtils]: 31: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-15 07:12:15,449 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {840#true} {841#false} #157#return; {841#false} is VALID [2022-04-15 07:12:15,449 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-15 07:12:15,449 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-15 07:12:15,449 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-15 07:12:15,449 INFO L290 TraceCheckUtils]: 36: Hoare triple {840#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {840#true} is VALID [2022-04-15 07:12:15,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-15 07:12:15,450 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {840#true} {841#false} #159#return; {841#false} is VALID [2022-04-15 07:12:15,450 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-15 07:12:15,450 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-15 07:12:15,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {841#false} ~cond := #in~cond; {841#false} is VALID [2022-04-15 07:12:15,450 INFO L290 TraceCheckUtils]: 42: Hoare triple {841#false} assume 0 == ~cond; {841#false} is VALID [2022-04-15 07:12:15,450 INFO L290 TraceCheckUtils]: 43: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-15 07:12:15,451 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-15 07:12:15,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:15,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028355168] [2022-04-15 07:12:15,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028355168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:15,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:15,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:12:15,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:15,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [640807021] [2022-04-15 07:12:15,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [640807021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:15,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:15,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:12:15,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282996557] [2022-04-15 07:12:15,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:15,453 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-15 07:12:15,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:15,454 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-15 07:12:15,489 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-15 07:12:15,489 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:12:15,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:15,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:12:15,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:12:15,490 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-15 07:12:17,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:17,608 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2022-04-15 07:12:17,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:12:17,609 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-15 07:12:17,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:17,609 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-15 07:12:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2022-04-15 07:12:17,628 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-15 07:12:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2022-04-15 07:12:17,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 197 transitions. [2022-04-15 07:12:17,849 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-15 07:12:17,853 INFO L225 Difference]: With dead ends: 154 [2022-04-15 07:12:17,854 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 07:12:17,855 INFO L912 BasicCegarLoop]: 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-15 07:12:17,856 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 133 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:17,856 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 79 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 07:12:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 07:12:17,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2022-04-15 07:12:17,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:17,869 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-15 07:12:17,870 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-15 07:12:17,871 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-15 07:12:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:17,876 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-15 07:12:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2022-04-15 07:12:17,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:17,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:17,879 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-15 07:12:17,879 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-15 07:12:17,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:17,884 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-15 07:12:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2022-04-15 07:12:17,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:17,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:17,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:17,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:17,887 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-15 07:12:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2022-04-15 07:12:17,891 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 44 [2022-04-15 07:12:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:17,891 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2022-04-15 07:12:17,891 INFO L479 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-15 07:12:17,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 113 transitions. [2022-04-15 07:12:18,025 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-15 07:12:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-04-15 07:12:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 07:12:18,027 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:18,027 INFO L499 BasicCegarLoop]: 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-15 07:12:18,027 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:12:18,027 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:18,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:18,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2001282500, now seen corresponding path program 1 times [2022-04-15 07:12:18,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:18,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [327288631] [2022-04-15 07:12:18,029 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:12:18,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2001282500, now seen corresponding path program 2 times [2022-04-15 07:12:18,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:18,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901850104] [2022-04-15 07:12:18,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:18,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:18,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:18,134 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-15 07:12:18,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1576#true} {1576#true} #181#return; {1576#true} is VALID [2022-04-15 07:12:18,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 07:12:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:18,178 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-15 07:12:18,179 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-15 07:12:18,180 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-15 07:12:18,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 07:12:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:18,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {1576#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1576#true} is VALID [2022-04-15 07:12:18,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1576#true} is VALID [2022-04-15 07:12:18,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,191 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-15 07:12:18,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 07:12:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:18,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 07:12:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:18,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-15 07:12:18,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-15 07:12:18,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,279 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-15 07:12:18,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-15 07:12:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:18,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-15 07:12:18,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-15 07:12:18,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,295 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-15 07:12:18,296 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-15 07:12:18,296 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, 4); {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-15 07:12:18,297 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-15 07:12:18,297 INFO L290 TraceCheckUtils]: 3: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-15 07:12:18,297 INFO L290 TraceCheckUtils]: 4: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-15 07:12:18,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,298 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-15 07:12:18,299 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, 8 + ~t.offset, 4); {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 07:12:18,299 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-15 07:12:18,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-15 07:12:18,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-15 07:12:18,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,300 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-15 07:12:18,301 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-15 07:12:18,301 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-15 07:12:18,302 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-15 07:12:18,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-15 07:12:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:18,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-15 07:12:18,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-15 07:12:18,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1577#false} #155#return; {1577#false} is VALID [2022-04-15 07:12:18,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-15 07:12:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:18,330 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-15 07:12:18,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,330 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1576#true} {1577#false} #157#return; {1577#false} is VALID [2022-04-15 07:12:18,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 07:12:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:18,346 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-15 07:12:18,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1576#true} is VALID [2022-04-15 07:12:18,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1577#false} #159#return; {1577#false} is VALID [2022-04-15 07:12:18,348 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-15 07:12:18,348 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-15 07:12:18,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #181#return; {1576#true} is VALID [2022-04-15 07:12:18,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret45 := main(); {1576#true} is VALID [2022-04-15 07:12:18,349 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-15 07:12:18,350 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-15 07:12:18,350 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-15 07:12:18,351 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-15 07:12:18,352 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-15 07:12:18,353 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-15 07:12:18,353 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-15 07:12:18,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {1576#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1576#true} is VALID [2022-04-15 07:12:18,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1576#true} is VALID [2022-04-15 07:12:18,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,354 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-15 07:12:18,355 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-15 07:12:18,355 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-15 07:12:18,356 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-15 07:12:18,356 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, 4); {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-15 07:12:18,356 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-15 07:12:18,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-15 07:12:18,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-15 07:12:18,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,358 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-15 07:12:18,358 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, 8 + ~t.offset, 4); {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 07:12:18,359 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-15 07:12:18,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-15 07:12:18,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-15 07:12:18,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,360 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-15 07:12:18,360 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-15 07:12:18,360 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-15 07:12:18,361 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-15 07:12:18,362 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-15 07:12:18,362 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-15 07:12:18,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-15 07:12:18,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-15 07:12:18,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,362 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1576#true} {1577#false} #155#return; {1577#false} is VALID [2022-04-15 07:12:18,362 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-15 07:12:18,363 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-15 07:12:18,363 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-15 07:12:18,363 INFO L290 TraceCheckUtils]: 43: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,363 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1576#true} {1577#false} #157#return; {1577#false} is VALID [2022-04-15 07:12:18,363 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-15 07:12:18,363 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-15 07:12:18,363 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-15 07:12:18,363 INFO L290 TraceCheckUtils]: 48: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1576#true} is VALID [2022-04-15 07:12:18,364 INFO L290 TraceCheckUtils]: 49: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,364 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1576#true} {1577#false} #159#return; {1577#false} is VALID [2022-04-15 07:12:18,364 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-15 07:12:18,364 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-15 07:12:18,364 INFO L290 TraceCheckUtils]: 53: Hoare triple {1577#false} ~cond := #in~cond; {1577#false} is VALID [2022-04-15 07:12:18,364 INFO L290 TraceCheckUtils]: 54: Hoare triple {1577#false} assume 0 == ~cond; {1577#false} is VALID [2022-04-15 07:12:18,364 INFO L290 TraceCheckUtils]: 55: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-15 07:12:18,365 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-15 07:12:18,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:18,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901850104] [2022-04-15 07:12:18,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901850104] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:12:18,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785185179] [2022-04-15 07:12:18,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:12:18,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:12:18,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:12:18,371 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-15 07:12:18,380 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-15 07:12:18,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:12:18,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:12:18,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 07:12:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:18,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:12:18,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-15 07:12:18,932 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-15 07:12:18,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #181#return; {1576#true} is VALID [2022-04-15 07:12:18,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret45 := main(); {1576#true} is VALID [2022-04-15 07:12:18,933 INFO L272 TraceCheckUtils]: 5: Hoare triple {1576#true} call #t~ret44.base, #t~ret44.offset := nondet_tree(); {1576#true} is VALID [2022-04-15 07:12:18,933 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-15 07:12:18,934 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-15 07:12:18,935 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-15 07:12:18,937 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-15 07:12:18,941 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-15 07:12:18,943 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-15 07:12:18,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {1576#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1576#true} is VALID [2022-04-15 07:12:18,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1576#true} is VALID [2022-04-15 07:12:18,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,953 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-15 07:12:18,958 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-15 07:12:18,959 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-15 07:12:18,959 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-15 07:12:18,960 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, 4); {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 07:12:18,960 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-15 07:12:18,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-15 07:12:18,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-15 07:12:18,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,962 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-15 07:12:18,963 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, 8 + ~t.offset, 4); {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 07:12:18,963 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-15 07:12:18,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-15 07:12:18,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-15 07:12:18,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:18,964 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-15 07:12:18,964 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-15 07:12:18,965 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-15 07:12:18,966 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-15 07:12:18,966 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-15 07:12:18,966 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-15 07:12:18,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {1577#false} ~cond := #in~cond; {1577#false} is VALID [2022-04-15 07:12:18,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {1577#false} assume !(0 == ~cond); {1577#false} is VALID [2022-04-15 07:12:18,966 INFO L290 TraceCheckUtils]: 38: Hoare triple {1577#false} assume true; {1577#false} is VALID [2022-04-15 07:12:18,966 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1577#false} {1577#false} #155#return; {1577#false} is VALID [2022-04-15 07:12:18,966 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-15 07:12:18,966 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-15 07:12:18,967 INFO L290 TraceCheckUtils]: 42: Hoare triple {1577#false} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1577#false} is VALID [2022-04-15 07:12:18,967 INFO L290 TraceCheckUtils]: 43: Hoare triple {1577#false} assume true; {1577#false} is VALID [2022-04-15 07:12:18,967 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1577#false} {1577#false} #157#return; {1577#false} is VALID [2022-04-15 07:12:18,967 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-15 07:12:18,967 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-15 07:12:18,967 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-15 07:12:18,967 INFO L290 TraceCheckUtils]: 48: Hoare triple {1577#false} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1577#false} is VALID [2022-04-15 07:12:18,967 INFO L290 TraceCheckUtils]: 49: Hoare triple {1577#false} assume true; {1577#false} is VALID [2022-04-15 07:12:18,967 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1577#false} {1577#false} #159#return; {1577#false} is VALID [2022-04-15 07:12:18,967 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-15 07:12:18,968 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-15 07:12:18,968 INFO L290 TraceCheckUtils]: 53: Hoare triple {1577#false} ~cond := #in~cond; {1577#false} is VALID [2022-04-15 07:12:18,968 INFO L290 TraceCheckUtils]: 54: Hoare triple {1577#false} assume 0 == ~cond; {1577#false} is VALID [2022-04-15 07:12:18,968 INFO L290 TraceCheckUtils]: 55: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-15 07:12:18,970 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-15 07:12:18,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:12:19,446 INFO L290 TraceCheckUtils]: 55: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-15 07:12:19,447 INFO L290 TraceCheckUtils]: 54: Hoare triple {1577#false} assume 0 == ~cond; {1577#false} is VALID [2022-04-15 07:12:19,447 INFO L290 TraceCheckUtils]: 53: Hoare triple {1577#false} ~cond := #in~cond; {1577#false} is VALID [2022-04-15 07:12:19,447 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-15 07:12:19,447 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-15 07:12:19,447 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1576#true} {1577#false} #159#return; {1577#false} is VALID [2022-04-15 07:12:19,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:19,447 INFO L290 TraceCheckUtils]: 48: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1576#true} is VALID [2022-04-15 07:12:19,448 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-15 07:12:19,448 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-15 07:12:19,448 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-15 07:12:19,448 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1576#true} {1577#false} #157#return; {1577#false} is VALID [2022-04-15 07:12:19,448 INFO L290 TraceCheckUtils]: 43: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:19,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {1576#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1576#true} is VALID [2022-04-15 07:12:19,448 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-15 07:12:19,448 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-15 07:12:19,449 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1576#true} {1577#false} #155#return; {1577#false} is VALID [2022-04-15 07:12:19,449 INFO L290 TraceCheckUtils]: 38: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:19,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-15 07:12:19,449 INFO L290 TraceCheckUtils]: 36: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-15 07:12:19,449 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-15 07:12:19,449 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-15 07:12:19,450 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-15 07:12:19,451 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-15 07:12:19,451 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-15 07:12:19,452 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-15 07:12:19,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:19,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-15 07:12:19,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-15 07:12:19,453 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-15 07:12:19,453 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, 8 + ~t.offset, 4); {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 07:12:19,454 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-15 07:12:19,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:19,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1576#true} is VALID [2022-04-15 07:12:19,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {1576#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1576#true} is VALID [2022-04-15 07:12:19,455 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-15 07:12:19,456 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, 4); {1627#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 07:12:19,456 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-15 07:12:19,456 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-15 07:12:19,460 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-15 07:12:19,461 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-15 07:12:19,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:19,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1576#true} is VALID [2022-04-15 07:12:19,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {1576#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1576#true} is VALID [2022-04-15 07:12:19,462 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-15 07:12:19,462 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-15 07:12:19,463 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-15 07:12:19,468 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-15 07:12:19,468 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-15 07:12:19,469 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-15 07:12:19,469 INFO L272 TraceCheckUtils]: 5: Hoare triple {1576#true} call #t~ret44.base, #t~ret44.offset := nondet_tree(); {1576#true} is VALID [2022-04-15 07:12:19,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret45 := main(); {1576#true} is VALID [2022-04-15 07:12:19,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #181#return; {1576#true} is VALID [2022-04-15 07:12:19,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:12:19,470 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-15 07:12:19,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-15 07:12:19,470 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-15 07:12:19,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785185179] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:12:19,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:12:19,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 15 [2022-04-15 07:12:19,471 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:19,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [327288631] [2022-04-15 07:12:19,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [327288631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:19,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:19,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 07:12:19,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775832841] [2022-04-15 07:12:19,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:19,472 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-15 07:12:19,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:19,473 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-15 07:12:19,526 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-15 07:12:19,526 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 07:12:19,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:19,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 07:12:19,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-15 07:12:19,527 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-15 07:12:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:22,420 INFO L93 Difference]: Finished difference Result 164 states and 209 transitions. [2022-04-15 07:12:22,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 07:12:22,420 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-15 07:12:22,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:22,421 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-15 07:12:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2022-04-15 07:12:22,425 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-15 07:12:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2022-04-15 07:12:22,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 205 transitions. [2022-04-15 07:12:22,639 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-15 07:12:22,642 INFO L225 Difference]: With dead ends: 164 [2022-04-15 07:12:22,642 INFO L226 Difference]: Without dead ends: 96 [2022-04-15 07:12:22,643 INFO L912 BasicCegarLoop]: 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-15 07:12:22,644 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 175 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:22,645 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 84 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 07:12:22,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-15 07:12:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2022-04-15 07:12:22,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:22,673 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-15 07:12:22,673 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-15 07:12:22,676 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-15 07:12:22,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:22,682 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2022-04-15 07:12:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2022-04-15 07:12:22,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:22,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:22,683 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-15 07:12:22,684 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-15 07:12:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:22,692 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2022-04-15 07:12:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2022-04-15 07:12:22,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:22,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:22,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:22,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:22,694 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-15 07:12:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2022-04-15 07:12:22,698 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 56 [2022-04-15 07:12:22,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:22,698 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2022-04-15 07:12:22,698 INFO L479 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-15 07:12:22,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 116 transitions. [2022-04-15 07:12:22,861 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-15 07:12:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2022-04-15 07:12:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 07:12:22,862 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:22,862 INFO L499 BasicCegarLoop]: 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-15 07:12:22,882 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-15 07:12:23,063 WARN L460 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-15 07:12:23,064 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:23,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:23,064 INFO L85 PathProgramCache]: Analyzing trace with hash 921875361, now seen corresponding path program 1 times [2022-04-15 07:12:23,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:23,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [369957608] [2022-04-15 07:12:23,065 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:12:23,065 INFO L85 PathProgramCache]: Analyzing trace with hash 921875361, now seen corresponding path program 2 times [2022-04-15 07:12:23,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:23,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474596204] [2022-04-15 07:12:23,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:23,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:23,153 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-15 07:12:23,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2695#true} {2695#true} #181#return; {2695#true} is VALID [2022-04-15 07:12:23,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 07:12:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:23,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 07:12:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:23,221 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-15 07:12:23,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,224 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-15 07:12:23,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:12:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:23,231 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-15 07:12:23,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,232 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-15 07:12:23,233 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(12);~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-15 07:12:23,233 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-15 07:12:23,234 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-15 07:12:23,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,234 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-15 07:12:23,235 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, 4);havoc #t~ret8.base, #t~ret8.offset; {2749#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-15 07:12:23,235 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-15 07:12:23,235 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-15 07:12:23,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,237 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-15 07:12:23,237 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, 8 + ~n~0.offset, 4);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-15 07:12:23,238 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-15 07:12:23,238 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-15 07:12:23,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 07:12:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:23,266 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-15 07:12:23,267 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-15 07:12:23,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {2758#(= |min_#in~n.base| 0)} assume true; {2758#(= |min_#in~n.base| 0)} is VALID [2022-04-15 07:12:23,268 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-15 07:12:23,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 07:12:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:23,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 07:12:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:23,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2695#true} is VALID [2022-04-15 07:12:23,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2695#true} is VALID [2022-04-15 07:12:23,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2695#true} {2695#true} #177#return; {2695#true} is VALID [2022-04-15 07:12:23,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-15 07:12:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:23,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2695#true} is VALID [2022-04-15 07:12:23,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2695#true} is VALID [2022-04-15 07:12:23,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2695#true} {2695#true} #179#return; {2695#true} is VALID [2022-04-15 07:12:23,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2695#true} is VALID [2022-04-15 07:12:23,287 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, 4); {2695#true} is VALID [2022-04-15 07:12:23,288 INFO L272 TraceCheckUtils]: 2: Hoare triple {2695#true} call #t~ret28 := size(#t~mem27.base, #t~mem27.offset); {2695#true} is VALID [2022-04-15 07:12:23,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {2695#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2695#true} is VALID [2022-04-15 07:12:23,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {2695#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2695#true} is VALID [2022-04-15 07:12:23,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,288 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2695#true} {2695#true} #177#return; {2695#true} is VALID [2022-04-15 07:12:23,288 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, 8 + ~t.offset, 4); {2695#true} is VALID [2022-04-15 07:12:23,288 INFO L272 TraceCheckUtils]: 8: Hoare triple {2695#true} call #t~ret30 := size(#t~mem29.base, #t~mem29.offset); {2695#true} is VALID [2022-04-15 07:12:23,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {2695#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2695#true} is VALID [2022-04-15 07:12:23,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {2695#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2695#true} is VALID [2022-04-15 07:12:23,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,289 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2695#true} {2695#true} #179#return; {2695#true} is VALID [2022-04-15 07:12:23,289 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-15 07:12:23,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,289 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2695#true} {2696#false} #153#return; {2696#false} is VALID [2022-04-15 07:12:23,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-15 07:12:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:23,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#true} ~cond := #in~cond; {2695#true} is VALID [2022-04-15 07:12:23,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume !(0 == ~cond); {2695#true} is VALID [2022-04-15 07:12:23,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2695#true} {2696#false} #155#return; {2696#false} is VALID [2022-04-15 07:12:23,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-15 07:12:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:23,305 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-15 07:12:23,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,305 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2695#true} {2696#false} #157#return; {2696#false} is VALID [2022-04-15 07:12:23,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-15 07:12:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:23,321 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-15 07:12:23,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2695#true} is VALID [2022-04-15 07:12:23,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2695#true} {2696#false} #159#return; {2696#false} is VALID [2022-04-15 07:12:23,322 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-15 07:12:23,322 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-15 07:12:23,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2695#true} {2695#true} #181#return; {2695#true} is VALID [2022-04-15 07:12:23,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {2695#true} call #t~ret45 := main(); {2695#true} is VALID [2022-04-15 07:12:23,323 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-15 07:12:23,324 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(12);~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-15 07:12:23,324 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-15 07:12:23,324 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-15 07:12:23,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,325 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-15 07:12:23,325 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, 4);havoc #t~ret8.base, #t~ret8.offset; {2749#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-15 07:12:23,326 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-15 07:12:23,326 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-15 07:12:23,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,327 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-15 07:12:23,327 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, 8 + ~n~0.offset, 4);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-15 07:12:23,328 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-15 07:12:23,329 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-15 07:12:23,329 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-15 07:12:23,330 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-15 07:12:23,330 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-15 07:12:23,331 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-15 07:12:23,331 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-15 07:12:23,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {2758#(= |min_#in~n.base| 0)} assume true; {2758#(= |min_#in~n.base| 0)} is VALID [2022-04-15 07:12:23,332 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-15 07:12:23,332 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-15 07:12:23,332 INFO L272 TraceCheckUtils]: 27: Hoare triple {2696#false} call #t~ret32 := size(~t.base, ~t.offset); {2695#true} is VALID [2022-04-15 07:12:23,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {2695#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2695#true} is VALID [2022-04-15 07:12:23,333 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, 4); {2695#true} is VALID [2022-04-15 07:12:23,333 INFO L272 TraceCheckUtils]: 30: Hoare triple {2695#true} call #t~ret28 := size(#t~mem27.base, #t~mem27.offset); {2695#true} is VALID [2022-04-15 07:12:23,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {2695#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2695#true} is VALID [2022-04-15 07:12:23,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {2695#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2695#true} is VALID [2022-04-15 07:12:23,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,333 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2695#true} {2695#true} #177#return; {2695#true} is VALID [2022-04-15 07:12:23,333 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, 8 + ~t.offset, 4); {2695#true} is VALID [2022-04-15 07:12:23,333 INFO L272 TraceCheckUtils]: 36: Hoare triple {2695#true} call #t~ret30 := size(#t~mem29.base, #t~mem29.offset); {2695#true} is VALID [2022-04-15 07:12:23,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {2695#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2695#true} is VALID [2022-04-15 07:12:23,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {2695#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2695#true} is VALID [2022-04-15 07:12:23,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,334 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2695#true} {2695#true} #179#return; {2695#true} is VALID [2022-04-15 07:12:23,334 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-15 07:12:23,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,334 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2695#true} {2696#false} #153#return; {2696#false} is VALID [2022-04-15 07:12:23,334 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-15 07:12:23,334 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-15 07:12:23,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {2695#true} ~cond := #in~cond; {2695#true} is VALID [2022-04-15 07:12:23,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {2695#true} assume !(0 == ~cond); {2695#true} is VALID [2022-04-15 07:12:23,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,334 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2695#true} {2696#false} #155#return; {2696#false} is VALID [2022-04-15 07:12:23,334 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-15 07:12:23,334 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-15 07:12:23,335 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-15 07:12:23,335 INFO L290 TraceCheckUtils]: 53: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,335 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {2695#true} {2696#false} #157#return; {2696#false} is VALID [2022-04-15 07:12:23,335 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-15 07:12:23,335 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-15 07:12:23,335 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-15 07:12:23,335 INFO L290 TraceCheckUtils]: 58: Hoare triple {2695#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2695#true} is VALID [2022-04-15 07:12:23,335 INFO L290 TraceCheckUtils]: 59: Hoare triple {2695#true} assume true; {2695#true} is VALID [2022-04-15 07:12:23,335 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2695#true} {2696#false} #159#return; {2696#false} is VALID [2022-04-15 07:12:23,335 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-15 07:12:23,335 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-15 07:12:23,336 INFO L290 TraceCheckUtils]: 63: Hoare triple {2696#false} ~cond := #in~cond; {2696#false} is VALID [2022-04-15 07:12:23,336 INFO L290 TraceCheckUtils]: 64: Hoare triple {2696#false} assume 0 == ~cond; {2696#false} is VALID [2022-04-15 07:12:23,336 INFO L290 TraceCheckUtils]: 65: Hoare triple {2696#false} assume !false; {2696#false} is VALID [2022-04-15 07:12:23,336 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-15 07:12:23,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:23,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474596204] [2022-04-15 07:12:23,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474596204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:23,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:23,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 07:12:23,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:23,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [369957608] [2022-04-15 07:12:23,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [369957608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:23,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:23,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 07:12:23,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597533560] [2022-04-15 07:12:23,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:23,338 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-15 07:12:23,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:23,338 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-15 07:12:23,385 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-15 07:12:23,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 07:12:23,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:23,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 07:12:23,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:12:23,386 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-15 07:12:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:25,847 INFO L93 Difference]: Finished difference Result 163 states and 208 transitions. [2022-04-15 07:12:25,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 07:12:25,848 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-15 07:12:25,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:25,848 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-15 07:12:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 200 transitions. [2022-04-15 07:12:25,852 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-15 07:12:25,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 200 transitions. [2022-04-15 07:12:25,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 200 transitions. [2022-04-15 07:12:26,044 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-15 07:12:26,049 INFO L225 Difference]: With dead ends: 163 [2022-04-15 07:12:26,049 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 07:12:26,050 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-04-15 07:12:26,051 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 168 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:26,051 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 82 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 07:12:26,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 07:12:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2022-04-15 07:12:26,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:26,074 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-15 07:12:26,074 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-15 07:12:26,074 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-15 07:12:26,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:26,078 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2022-04-15 07:12:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2022-04-15 07:12:26,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:26,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:26,080 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-15 07:12:26,080 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-15 07:12:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:26,084 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2022-04-15 07:12:26,084 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2022-04-15 07:12:26,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:26,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:26,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:26,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:26,086 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-15 07:12:26,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2022-04-15 07:12:26,089 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 66 [2022-04-15 07:12:26,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:26,089 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2022-04-15 07:12:26,090 INFO L479 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-15 07:12:26,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 119 transitions. [2022-04-15 07:12:26,242 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-15 07:12:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2022-04-15 07:12:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 07:12:26,243 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:26,243 INFO L499 BasicCegarLoop]: 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-15 07:12:26,244 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 07:12:26,244 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:26,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:26,246 INFO L85 PathProgramCache]: Analyzing trace with hash 940648973, now seen corresponding path program 1 times [2022-04-15 07:12:26,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:26,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1387300063] [2022-04-15 07:12:26,247 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:12:26,247 INFO L85 PathProgramCache]: Analyzing trace with hash 940648973, now seen corresponding path program 2 times [2022-04-15 07:12:26,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:26,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134369223] [2022-04-15 07:12:26,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:26,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:26,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:26,329 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-15 07:12:26,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,330 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3505#true} {3505#true} #181#return; {3505#true} is VALID [2022-04-15 07:12:26,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 07:12:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:26,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 07:12:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:26,383 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-15 07:12:26,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,384 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-15 07:12:26,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:12:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:26,390 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-15 07:12:26,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,390 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-15 07:12:26,391 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(12);~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-15 07:12:26,392 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-15 07:12:26,392 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-15 07:12:26,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,392 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-15 07:12:26,393 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, 4);havoc #t~ret8.base, #t~ret8.offset; {3572#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-15 07:12:26,394 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-15 07:12:26,394 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-15 07:12:26,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,394 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-15 07:12:26,395 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, 8 + ~n~0.offset, 4);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-15 07:12:26,395 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-15 07:12:26,396 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-15 07:12:26,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 07:12:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 07:12:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:26,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3505#true} is VALID [2022-04-15 07:12:26,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {3505#true} is VALID [2022-04-15 07:12:26,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3505#true} {3505#true} #143#return; {3505#true} is VALID [2022-04-15 07:12:26,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-15 07:12:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:26,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3505#true} is VALID [2022-04-15 07:12:26,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {3505#true} is VALID [2022-04-15 07:12:26,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3505#true} {3505#true} #145#return; {3505#true} is VALID [2022-04-15 07:12:26,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3505#true} is VALID [2022-04-15 07:12:26,415 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, 4); {3505#true} is VALID [2022-04-15 07:12:26,415 INFO L272 TraceCheckUtils]: 2: Hoare triple {3505#true} call #t~ret11 := min(#t~mem10.base, #t~mem10.offset); {3505#true} is VALID [2022-04-15 07:12:26,415 INFO L290 TraceCheckUtils]: 3: Hoare triple {3505#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3505#true} is VALID [2022-04-15 07:12:26,415 INFO L290 TraceCheckUtils]: 4: Hoare triple {3505#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {3505#true} is VALID [2022-04-15 07:12:26,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,415 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3505#true} {3505#true} #143#return; {3505#true} is VALID [2022-04-15 07:12:26,415 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, 8 + ~n.offset, 4); {3505#true} is VALID [2022-04-15 07:12:26,415 INFO L272 TraceCheckUtils]: 8: Hoare triple {3505#true} call #t~ret13 := min(#t~mem12.base, #t~mem12.offset); {3505#true} is VALID [2022-04-15 07:12:26,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {3505#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3505#true} is VALID [2022-04-15 07:12:26,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {3505#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {3505#true} is VALID [2022-04-15 07:12:26,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,416 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3505#true} {3505#true} #145#return; {3505#true} is VALID [2022-04-15 07:12:26,416 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-15 07:12:26,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {3505#true} assume ~a~0 <= ~b~0;#res := ~a~0; {3505#true} is VALID [2022-04-15 07:12:26,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,417 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-15 07:12:26,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-15 07:12:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:26,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 07:12:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:26,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3505#true} is VALID [2022-04-15 07:12:26,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {3505#true} is VALID [2022-04-15 07:12:26,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3505#true} {3505#true} #177#return; {3505#true} is VALID [2022-04-15 07:12:26,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-15 07:12:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:26,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3505#true} is VALID [2022-04-15 07:12:26,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {3505#true} is VALID [2022-04-15 07:12:26,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3505#true} {3505#true} #179#return; {3505#true} is VALID [2022-04-15 07:12:26,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3505#true} is VALID [2022-04-15 07:12:26,434 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, 4); {3505#true} is VALID [2022-04-15 07:12:26,434 INFO L272 TraceCheckUtils]: 2: Hoare triple {3505#true} call #t~ret28 := size(#t~mem27.base, #t~mem27.offset); {3505#true} is VALID [2022-04-15 07:12:26,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {3505#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3505#true} is VALID [2022-04-15 07:12:26,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {3505#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {3505#true} is VALID [2022-04-15 07:12:26,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,435 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3505#true} {3505#true} #177#return; {3505#true} is VALID [2022-04-15 07:12:26,435 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, 8 + ~t.offset, 4); {3505#true} is VALID [2022-04-15 07:12:26,435 INFO L272 TraceCheckUtils]: 8: Hoare triple {3505#true} call #t~ret30 := size(#t~mem29.base, #t~mem29.offset); {3505#true} is VALID [2022-04-15 07:12:26,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {3505#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3505#true} is VALID [2022-04-15 07:12:26,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {3505#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {3505#true} is VALID [2022-04-15 07:12:26,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,435 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3505#true} {3505#true} #179#return; {3505#true} is VALID [2022-04-15 07:12:26,436 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-15 07:12:26,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,436 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-15 07:12:26,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-15 07:12:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:26,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} ~cond := #in~cond; {3505#true} is VALID [2022-04-15 07:12:26,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume !(0 == ~cond); {3505#true} is VALID [2022-04-15 07:12:26,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,441 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-15 07:12:26,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-15 07:12:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:26,454 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-15 07:12:26,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,455 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-15 07:12:26,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-04-15 07:12:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:26,488 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-15 07:12:26,488 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-15 07:12:26,489 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-15 07:12:26,490 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-15 07:12:26,491 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-15 07:12:26,491 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-15 07:12:26,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3505#true} {3505#true} #181#return; {3505#true} is VALID [2022-04-15 07:12:26,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {3505#true} call #t~ret45 := main(); {3505#true} is VALID [2022-04-15 07:12:26,492 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-15 07:12:26,492 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(12);~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-15 07:12:26,493 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-15 07:12:26,493 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-15 07:12:26,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,493 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-15 07:12:26,494 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, 4);havoc #t~ret8.base, #t~ret8.offset; {3572#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-15 07:12:26,495 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-15 07:12:26,495 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-15 07:12:26,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,495 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-15 07:12:26,496 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, 8 + ~n~0.offset, 4);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-15 07:12:26,496 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-15 07:12:26,497 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-15 07:12:26,498 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-15 07:12:26,498 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-15 07:12:26,499 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-15 07:12:26,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {3505#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3505#true} is VALID [2022-04-15 07:12:26,499 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, 4); {3505#true} is VALID [2022-04-15 07:12:26,499 INFO L272 TraceCheckUtils]: 24: Hoare triple {3505#true} call #t~ret11 := min(#t~mem10.base, #t~mem10.offset); {3505#true} is VALID [2022-04-15 07:12:26,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {3505#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3505#true} is VALID [2022-04-15 07:12:26,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {3505#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {3505#true} is VALID [2022-04-15 07:12:26,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,499 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3505#true} {3505#true} #143#return; {3505#true} is VALID [2022-04-15 07:12:26,500 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, 8 + ~n.offset, 4); {3505#true} is VALID [2022-04-15 07:12:26,500 INFO L272 TraceCheckUtils]: 30: Hoare triple {3505#true} call #t~ret13 := min(#t~mem12.base, #t~mem12.offset); {3505#true} is VALID [2022-04-15 07:12:26,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {3505#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3505#true} is VALID [2022-04-15 07:12:26,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {3505#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {3505#true} is VALID [2022-04-15 07:12:26,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,500 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3505#true} {3505#true} #145#return; {3505#true} is VALID [2022-04-15 07:12:26,500 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-15 07:12:26,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {3505#true} assume ~a~0 <= ~b~0;#res := ~a~0; {3505#true} is VALID [2022-04-15 07:12:26,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,502 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-15 07:12:26,502 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-15 07:12:26,502 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-15 07:12:26,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {3505#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3505#true} is VALID [2022-04-15 07:12:26,503 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, 4); {3505#true} is VALID [2022-04-15 07:12:26,503 INFO L272 TraceCheckUtils]: 43: Hoare triple {3505#true} call #t~ret28 := size(#t~mem27.base, #t~mem27.offset); {3505#true} is VALID [2022-04-15 07:12:26,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {3505#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3505#true} is VALID [2022-04-15 07:12:26,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {3505#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {3505#true} is VALID [2022-04-15 07:12:26,503 INFO L290 TraceCheckUtils]: 46: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,503 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {3505#true} {3505#true} #177#return; {3505#true} is VALID [2022-04-15 07:12:26,503 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, 8 + ~t.offset, 4); {3505#true} is VALID [2022-04-15 07:12:26,503 INFO L272 TraceCheckUtils]: 49: Hoare triple {3505#true} call #t~ret30 := size(#t~mem29.base, #t~mem29.offset); {3505#true} is VALID [2022-04-15 07:12:26,503 INFO L290 TraceCheckUtils]: 50: Hoare triple {3505#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3505#true} is VALID [2022-04-15 07:12:26,503 INFO L290 TraceCheckUtils]: 51: Hoare triple {3505#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {3505#true} is VALID [2022-04-15 07:12:26,504 INFO L290 TraceCheckUtils]: 52: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,504 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3505#true} {3505#true} #179#return; {3505#true} is VALID [2022-04-15 07:12:26,504 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-15 07:12:26,504 INFO L290 TraceCheckUtils]: 55: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,504 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-15 07:12:26,505 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-15 07:12:26,505 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-15 07:12:26,505 INFO L290 TraceCheckUtils]: 59: Hoare triple {3505#true} ~cond := #in~cond; {3505#true} is VALID [2022-04-15 07:12:26,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {3505#true} assume !(0 == ~cond); {3505#true} is VALID [2022-04-15 07:12:26,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,506 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-15 07:12:26,506 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-15 07:12:26,507 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-15 07:12:26,507 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-15 07:12:26,507 INFO L290 TraceCheckUtils]: 66: Hoare triple {3505#true} assume true; {3505#true} is VALID [2022-04-15 07:12:26,508 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-15 07:12:26,508 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-15 07:12:26,510 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-15 07:12:26,510 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-15 07:12:26,510 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-15 07:12:26,511 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-15 07:12:26,512 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-15 07:12:26,512 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-15 07:12:26,512 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-15 07:12:26,512 INFO L290 TraceCheckUtils]: 76: Hoare triple {3506#false} ~cond := #in~cond; {3506#false} is VALID [2022-04-15 07:12:26,512 INFO L290 TraceCheckUtils]: 77: Hoare triple {3506#false} assume 0 == ~cond; {3506#false} is VALID [2022-04-15 07:12:26,512 INFO L290 TraceCheckUtils]: 78: Hoare triple {3506#false} assume !false; {3506#false} is VALID [2022-04-15 07:12:26,513 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-15 07:12:26,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:26,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134369223] [2022-04-15 07:12:26,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134369223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:26,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:26,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 07:12:26,513 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:26,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1387300063] [2022-04-15 07:12:26,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1387300063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:26,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:26,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 07:12:26,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501724961] [2022-04-15 07:12:26,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:26,515 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-15 07:12:26,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:26,515 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-15 07:12:26,562 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-15 07:12:26,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 07:12:26,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:26,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 07:12:26,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:12:26,564 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-15 07:12:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:29,046 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2022-04-15 07:12:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 07:12:29,046 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-15 07:12:29,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:29,047 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-15 07:12:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 181 transitions. [2022-04-15 07:12:29,050 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-15 07:12:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 181 transitions. [2022-04-15 07:12:29,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 181 transitions. [2022-04-15 07:12:29,264 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-15 07:12:29,266 INFO L225 Difference]: With dead ends: 151 [2022-04-15 07:12:29,267 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 07:12:29,267 INFO L912 BasicCegarLoop]: 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-15 07:12:29,268 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 126 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:29,269 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 82 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 07:12:29,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 07:12:29,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-04-15 07:12:29,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:29,296 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-15 07:12:29,297 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-15 07:12:29,297 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-15 07:12:29,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:29,301 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2022-04-15 07:12:29,301 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2022-04-15 07:12:29,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:29,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:29,302 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-15 07:12:29,302 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-15 07:12:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:29,308 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2022-04-15 07:12:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2022-04-15 07:12:29,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:29,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:29,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:29,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:29,309 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-15 07:12:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2022-04-15 07:12:29,315 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 79 [2022-04-15 07:12:29,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:29,315 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2022-04-15 07:12:29,316 INFO L479 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-15 07:12:29,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 123 transitions. [2022-04-15 07:12:29,514 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-15 07:12:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2022-04-15 07:12:29,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 07:12:29,515 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:29,515 INFO L499 BasicCegarLoop]: 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-15 07:12:29,515 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 07:12:29,515 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:29,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:29,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1677199096, now seen corresponding path program 1 times [2022-04-15 07:12:29,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:29,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [349070977] [2022-04-15 07:12:29,516 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:12:29,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1677199096, now seen corresponding path program 2 times [2022-04-15 07:12:29,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:29,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948102991] [2022-04-15 07:12:29,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:29,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 07:12:29,591 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 07:12:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 07:12:29,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 07:12:29,680 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 07:12:29,680 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 07:12:29,684 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 07:12:29,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 07:12:29,689 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2] [2022-04-15 07:12:29,692 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 07:12:29,718 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:12:29,719 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2022-04-15 07:12:29,719 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2022-04-15 07:12:29,719 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 07:12:29,719 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 07:12:29,719 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 07:12:29,719 WARN L170 areAnnotationChecker]: tree_delENTRY has no Hoare annotation [2022-04-15 07:12:29,719 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 07:12:29,719 WARN L170 areAnnotationChecker]: minENTRY has no Hoare annotation [2022-04-15 07:12:29,719 WARN L170 areAnnotationChecker]: taskENTRY has no Hoare annotation [2022-04-15 07:12:29,719 WARN L170 areAnnotationChecker]: sizeENTRY has no Hoare annotation [2022-04-15 07:12:29,719 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 07:12:29,719 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 07:12:29,719 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 07:12:29,719 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: tree_inorderENTRY has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: nondet_treeFINAL has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 07:12:29,720 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: minFINAL has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: sizeFINAL has no Hoare annotation [2022-04-15 07:12:29,721 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: tree_inorderFINAL has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: tree_delFINAL has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-15 07:12:29,722 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: tree_delEXIT has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-15 07:12:29,723 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 07:12:29,724 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 07:12:29,724 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-04-15 07:12:29,724 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2022-04-15 07:12:29,724 WARN L170 areAnnotationChecker]: L79-3 has no Hoare annotation [2022-04-15 07:12:29,724 WARN L170 areAnnotationChecker]: L79-2 has no Hoare annotation [2022-04-15 07:12:29,724 WARN L170 areAnnotationChecker]: L79-2 has no Hoare annotation [2022-04-15 07:12:29,724 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-04-15 07:12:29,724 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2022-04-15 07:12:29,724 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2022-04-15 07:12:29,724 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-04-15 07:12:29,724 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-04-15 07:12:29,724 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-04-15 07:12:29,724 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-04-15 07:12:29,724 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-04-15 07:12:29,724 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-04-15 07:12:29,724 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-04-15 07:12:29,725 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2022-04-15 07:12:29,725 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-15 07:12:29,725 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-15 07:12:29,725 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-04-15 07:12:29,726 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-04-15 07:12:29,726 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-15 07:12:29,726 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-15 07:12:29,726 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-15 07:12:29,726 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-04-15 07:12:29,726 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-04-15 07:12:29,726 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-15 07:12:29,726 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-15 07:12:29,726 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-04-15 07:12:29,726 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-04-15 07:12:29,726 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-04-15 07:12:29,726 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-04-15 07:12:29,726 WARN L170 areAnnotationChecker]: L100-3 has no Hoare annotation [2022-04-15 07:12:29,726 WARN L170 areAnnotationChecker]: L100-3 has no Hoare annotation [2022-04-15 07:12:29,727 WARN L170 areAnnotationChecker]: L100-3 has no Hoare annotation [2022-04-15 07:12:29,727 WARN L170 areAnnotationChecker]: L100-2 has no Hoare annotation [2022-04-15 07:12:29,727 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-15 07:12:29,727 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-15 07:12:29,727 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-04-15 07:12:29,727 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-04-15 07:12:29,727 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-15 07:12:29,727 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-15 07:12:29,727 WARN L170 areAnnotationChecker]: L100-4 has no Hoare annotation [2022-04-15 07:12:29,727 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-04-15 07:12:29,727 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-04-15 07:12:29,727 WARN L170 areAnnotationChecker]: taskFINAL has no Hoare annotation [2022-04-15 07:12:29,727 WARN L170 areAnnotationChecker]: taskEXIT has no Hoare annotation [2022-04-15 07:12:29,727 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-15 07:12:29,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 07:12:29 BoogieIcfgContainer [2022-04-15 07:12:29,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 07:12:29,736 INFO L158 Benchmark]: Toolchain (without parser) took 17932.34ms. Allocated memory was 177.2MB in the beginning and 264.2MB in the end (delta: 87.0MB). Free memory was 131.4MB in the beginning and 103.1MB in the end (delta: 28.4MB). Peak memory consumption was 116.1MB. Max. memory is 8.0GB. [2022-04-15 07:12:29,736 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 177.2MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:12:29,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.86ms. Allocated memory is still 177.2MB. Free memory was 131.3MB in the beginning and 153.1MB in the end (delta: -21.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 07:12:29,740 INFO L158 Benchmark]: Boogie Preprocessor took 50.56ms. Allocated memory is still 177.2MB. Free memory was 153.1MB in the beginning and 150.1MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-15 07:12:29,740 INFO L158 Benchmark]: RCFGBuilder took 603.64ms. Allocated memory is still 177.2MB. Free memory was 150.1MB in the beginning and 127.3MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-04-15 07:12:29,740 INFO L158 Benchmark]: TraceAbstraction took 16957.83ms. Allocated memory was 177.2MB in the beginning and 264.2MB in the end (delta: 87.0MB). Free memory was 126.8MB in the beginning and 103.1MB in the end (delta: 23.7MB). Peak memory consumption was 112.3MB. Max. memory is 8.0GB. [2022-04-15 07:12:29,741 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.20ms. Allocated memory is still 177.2MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 300.86ms. Allocated memory is still 177.2MB. Free memory was 131.3MB in the beginning and 153.1MB in the end (delta: -21.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.56ms. Allocated memory is still 177.2MB. Free memory was 153.1MB in the beginning and 150.1MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 603.64ms. Allocated memory is still 177.2MB. Free memory was 150.1MB in the beginning and 127.3MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 16957.83ms. Allocated memory was 177.2MB in the beginning and 264.2MB in the end (delta: 87.0MB). Free memory was 126.8MB in the beginning and 103.1MB in the end (delta: 23.7MB). Peak memory consumption was 112.3MB. 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: 16.9s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 824 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 769 mSDsluCounter, 407 SdHoareTripleChecker+Invalid, 4.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.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.9s 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.3s 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-15 07:12:29,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...