/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:17:29,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:17:29,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:17:29,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:17:29,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:17:29,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:17:29,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:17:29,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:17:29,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:17:29,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:17:29,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:17:29,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:17:29,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:17:29,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:17:29,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:17:29,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:17:29,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:17:29,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:17:29,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:17:29,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:17:29,375 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:17:29,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:17:29,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:17:29,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:17:29,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:17:29,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:17:29,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:17:29,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:17:29,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:17:29,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:17:29,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:17:29,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:17:29,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:17:29,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:17:29,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:17:29,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:17:29,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:17:29,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:17:29,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:17:29,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:17:29,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:17:29,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:17:29,386 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:17:29,392 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:17:29,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:17:29,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:17:29,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:17:29,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:17:29,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:17:29,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:17:29,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:17:29,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:17:29,394 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:17:29,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:17:29,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:17:29,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:17:29,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:17:29,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:17:29,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:17:29,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:17:29,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:17:29,395 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:17:29,395 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:17:29,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:17:29,395 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:17:29,395 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 13:17:29,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:17:29,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:17:29,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:17:29,582 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:17:29,584 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:17:29,585 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c [2022-04-15 13:17:29,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eea96874/31b604ce60674546b9355751338a852c/FLAGe4644f349 [2022-04-15 13:17:29,995 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:17:29,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c [2022-04-15 13:17:30,000 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eea96874/31b604ce60674546b9355751338a852c/FLAGe4644f349 [2022-04-15 13:17:30,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eea96874/31b604ce60674546b9355751338a852c [2022-04-15 13:17:30,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:17:30,012 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:17:30,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:17:30,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:17:30,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:17:30,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:17:30" (1/1) ... [2022-04-15 13:17:30,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b12e8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:30, skipping insertion in model container [2022-04-15 13:17:30,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:17:30" (1/1) ... [2022-04-15 13:17:30,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:17:30,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:17:30,143 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.c[586,599] [2022-04-15 13:17:30,158 WARN L1550 CHandler]: Possible shadowing of function min [2022-04-15 13:17:30,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:17:30,176 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:17:30,184 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.c[586,599] [2022-04-15 13:17:30,190 WARN L1550 CHandler]: Possible shadowing of function min [2022-04-15 13:17:30,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:17:30,210 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:17:30,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:30 WrapperNode [2022-04-15 13:17:30,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:17:30,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:17:30,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:17:30,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:17:30,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:30" (1/1) ... [2022-04-15 13:17:30,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:30" (1/1) ... [2022-04-15 13:17:30,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:30" (1/1) ... [2022-04-15 13:17:30,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:30" (1/1) ... [2022-04-15 13:17:30,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:30" (1/1) ... [2022-04-15 13:17:30,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:30" (1/1) ... [2022-04-15 13:17:30,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:30" (1/1) ... [2022-04-15 13:17:30,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:17:30,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:17:30,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:17:30,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:17:30,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:30" (1/1) ... [2022-04-15 13:17:30,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:17:30,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:17:30,293 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 13:17:30,297 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 13:17:30,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:17:30,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:17:30,330 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2022-04-15 13:17:30,330 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:17:30,331 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:17:30,331 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-04-15 13:17:30,331 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-04-15 13:17:30,331 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-04-15 13:17:30,331 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-04-15 13:17:30,331 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-04-15 13:17:30,331 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2022-04-15 13:17:30,331 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:17:30,331 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 13:17:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 13:17:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 13:17:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-15 13:17:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 13:17:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 13:17:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2022-04-15 13:17:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:17:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:17:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:17:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:17:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:17:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-04-15 13:17:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 13:17:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:17:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 13:17:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-04-15 13:17:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:17:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 13:17:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-04-15 13:17:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:17:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-04-15 13:17:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-04-15 13:17:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure task [2022-04-15 13:17:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 13:17:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 13:17:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:17:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:17:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:17:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:17:30,427 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:17:30,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:17:30,767 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:17:30,772 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:17:30,773 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 13:17:30,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:17:30 BoogieIcfgContainer [2022-04-15 13:17:30,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:17:30,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:17:30,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:17:30,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:17:30,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:17:30" (1/3) ... [2022-04-15 13:17:30,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64021059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:17:30, skipping insertion in model container [2022-04-15 13:17:30,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:17:30" (2/3) ... [2022-04-15 13:17:30,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64021059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:17:30, skipping insertion in model container [2022-04-15 13:17:30,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:17:30" (3/3) ... [2022-04-15 13:17:30,787 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2022-04-15 13:17:30,790 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:17:30,790 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:17:30,818 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:17:30,823 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 13:17:30,823 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:17:30,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 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 13:17:30,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 13:17:30,851 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:30,852 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 13:17:30,852 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:30,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:30,859 INFO L85 PathProgramCache]: Analyzing trace with hash -738616471, now seen corresponding path program 1 times [2022-04-15 13:17:30,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:30,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [607015960] [2022-04-15 13:17:30,874 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:17:30,874 INFO L85 PathProgramCache]: Analyzing trace with hash -738616471, now seen corresponding path program 2 times [2022-04-15 13:17:30,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:30,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659899772] [2022-04-15 13:17:30,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:30,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:31,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:17:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:31,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {130#(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(16, 2);call #Ultimate.allocInit(12, 3); {101#true} is VALID [2022-04-15 13:17:31,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {101#true} assume true; {101#true} is VALID [2022-04-15 13:17:31,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {101#true} {101#true} #197#return; {101#true} is VALID [2022-04-15 13:17:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 13:17:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:31,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {131#(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; {101#true} is VALID [2022-04-15 13:17:31,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {101#true} assume true; {101#true} is VALID [2022-04-15 13:17:31,183 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {101#true} {101#true} #155#return; {101#true} is VALID [2022-04-15 13:17:31,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:17:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:31,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {101#true} is VALID [2022-04-15 13:17:31,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {101#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {101#true} is VALID [2022-04-15 13:17:31,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {101#true} assume true; {101#true} is VALID [2022-04-15 13:17:31,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101#true} {101#true} #167#return; {101#true} is VALID [2022-04-15 13:17:31,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 13:17:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:31,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {101#true} is VALID [2022-04-15 13:17:31,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {101#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {132#(= |size_#res| 0)} is VALID [2022-04-15 13:17:31,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#(= |size_#res| 0)} assume true; {132#(= |size_#res| 0)} is VALID [2022-04-15 13:17:31,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132#(= |size_#res| 0)} {101#true} #169#return; {117#(= |task_#t~ret33| 0)} is VALID [2022-04-15 13:17:31,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 13:17:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:31,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#true} ~cond := #in~cond; {133#(= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|)} is VALID [2022-04-15 13:17:31,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {133#(= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|)} assume !(0 == ~cond); {134#(not (= |assume_cycle_if_not_#in~cond| 0))} is VALID [2022-04-15 13:17:31,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#(not (= |assume_cycle_if_not_#in~cond| 0))} assume true; {134#(not (= |assume_cycle_if_not_#in~cond| 0))} is VALID [2022-04-15 13:17:31,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134#(not (= |assume_cycle_if_not_#in~cond| 0))} {118#(= task_~n~1 0)} #171#return; {102#false} is VALID [2022-04-15 13:17:31,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 13:17:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:31,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {135#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {101#true} is VALID [2022-04-15 13:17:31,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {101#true} assume true; {101#true} is VALID [2022-04-15 13:17:31,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {101#true} {102#false} #173#return; {102#false} is VALID [2022-04-15 13:17:31,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 13:17:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:31,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#(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; {101#true} is VALID [2022-04-15 13:17:31,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {101#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {101#true} is VALID [2022-04-15 13:17:31,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {101#true} assume true; {101#true} is VALID [2022-04-15 13:17:31,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101#true} {102#false} #175#return; {102#false} is VALID [2022-04-15 13:17:31,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {101#true} call ULTIMATE.init(); {130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:17:31,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {130#(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(16, 2);call #Ultimate.allocInit(12, 3); {101#true} is VALID [2022-04-15 13:17:31,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {101#true} assume true; {101#true} is VALID [2022-04-15 13:17:31,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101#true} {101#true} #197#return; {101#true} is VALID [2022-04-15 13:17:31,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {101#true} call #t~ret46 := main(); {101#true} is VALID [2022-04-15 13:17:31,304 INFO L272 TraceCheckUtils]: 5: Hoare triple {101#true} call #t~ret45.base, #t~ret45.offset := nondet_tree(); {131#(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 13:17:31,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {131#(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; {101#true} is VALID [2022-04-15 13:17:31,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {101#true} assume true; {101#true} is VALID [2022-04-15 13:17:31,304 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {101#true} {101#true} #155#return; {101#true} is VALID [2022-04-15 13:17:31,305 INFO L272 TraceCheckUtils]: 9: Hoare triple {101#true} call task(#t~ret45.base, #t~ret45.offset); {101#true} is VALID [2022-04-15 13:17:31,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {101#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {101#true} is VALID [2022-04-15 13:17:31,305 INFO L272 TraceCheckUtils]: 11: Hoare triple {101#true} call #t~ret32 := min(~t.base, ~t.offset); {101#true} is VALID [2022-04-15 13:17:31,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {101#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {101#true} is VALID [2022-04-15 13:17:31,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {101#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {101#true} is VALID [2022-04-15 13:17:31,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {101#true} assume true; {101#true} is VALID [2022-04-15 13:17:31,306 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {101#true} {101#true} #167#return; {101#true} is VALID [2022-04-15 13:17:31,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {101#true} assume -2147483648 <= #t~ret32 && #t~ret32 <= 2147483647;~a~1 := #t~ret32;havoc #t~ret32;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {101#true} is VALID [2022-04-15 13:17:31,306 INFO L272 TraceCheckUtils]: 17: Hoare triple {101#true} call #t~ret33 := size(~t.base, ~t.offset); {101#true} is VALID [2022-04-15 13:17:31,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {101#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {101#true} is VALID [2022-04-15 13:17:31,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {101#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {132#(= |size_#res| 0)} is VALID [2022-04-15 13:17:31,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {132#(= |size_#res| 0)} assume true; {132#(= |size_#res| 0)} is VALID [2022-04-15 13:17:31,311 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {132#(= |size_#res| 0)} {101#true} #169#return; {117#(= |task_#t~ret33| 0)} is VALID [2022-04-15 13:17:31,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {117#(= |task_#t~ret33| 0)} assume -2147483648 <= #t~ret33 && #t~ret33 <= 2147483647;~n~1 := #t~ret33;havoc #t~ret33; {118#(= task_~n~1 0)} is VALID [2022-04-15 13:17:31,315 INFO L272 TraceCheckUtils]: 23: Hoare triple {118#(= task_~n~1 0)} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {101#true} is VALID [2022-04-15 13:17:31,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {101#true} ~cond := #in~cond; {133#(= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|)} is VALID [2022-04-15 13:17:31,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {133#(= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|)} assume !(0 == ~cond); {134#(not (= |assume_cycle_if_not_#in~cond| 0))} is VALID [2022-04-15 13:17:31,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {134#(not (= |assume_cycle_if_not_#in~cond| 0))} assume true; {134#(not (= |assume_cycle_if_not_#in~cond| 0))} is VALID [2022-04-15 13:17:31,319 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {134#(not (= |assume_cycle_if_not_#in~cond| 0))} {118#(= task_~n~1 0)} #171#return; {102#false} is VALID [2022-04-15 13:17:31,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {102#false} call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4 * ~n~1); {102#false} is VALID [2022-04-15 13:17:31,319 INFO L272 TraceCheckUtils]: 29: Hoare triple {102#false} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, ~n~1, 4, 4 * ~n~1); {135#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:31,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {135#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {101#true} is VALID [2022-04-15 13:17:31,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {101#true} assume true; {101#true} is VALID [2022-04-15 13:17:31,320 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {101#true} {102#false} #173#return; {102#false} is VALID [2022-04-15 13:17:31,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {102#false} ~x~0.base, ~x~0.offset := #t~malloc34.base, #t~malloc34.offset; {102#false} is VALID [2022-04-15 13:17:31,320 INFO L272 TraceCheckUtils]: 34: Hoare triple {102#false} call #t~ret35 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {136#(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 13:17:31,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {136#(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; {101#true} is VALID [2022-04-15 13:17:31,320 INFO L290 TraceCheckUtils]: 36: Hoare triple {101#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {101#true} is VALID [2022-04-15 13:17:31,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {101#true} assume true; {101#true} is VALID [2022-04-15 13:17:31,321 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {101#true} {102#false} #175#return; {102#false} is VALID [2022-04-15 13:17:31,321 INFO L290 TraceCheckUtils]: 39: Hoare triple {102#false} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;call #t~mem36 := read~int(~x~0.base, ~x~0.offset, 4); {102#false} is VALID [2022-04-15 13:17:31,321 INFO L272 TraceCheckUtils]: 40: Hoare triple {102#false} call __VERIFIER_assert((if ~a~1 == #t~mem36 then 1 else 0)); {102#false} is VALID [2022-04-15 13:17:31,321 INFO L290 TraceCheckUtils]: 41: Hoare triple {102#false} ~cond := #in~cond; {102#false} is VALID [2022-04-15 13:17:31,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {102#false} assume 0 == ~cond; {102#false} is VALID [2022-04-15 13:17:31,322 INFO L290 TraceCheckUtils]: 43: Hoare triple {102#false} assume !false; {102#false} is VALID [2022-04-15 13:17:31,322 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 13:17:31,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:31,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659899772] [2022-04-15 13:17:31,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659899772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:31,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:31,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 13:17:31,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:31,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [607015960] [2022-04-15 13:17:31,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [607015960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:31,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:31,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 13:17:31,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243172550] [2022-04-15 13:17:31,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:31,333 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 13:17:31,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:31,337 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 13:17:31,381 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 13:17:31,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 13:17:31,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:31,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 13:17:31,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:17:31,398 INFO L87 Difference]: Start difference. First operand has 98 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 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 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 13:17:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:33,331 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-04-15 13:17:33,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 13:17:33,332 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 13:17:33,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:33,333 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 13:17:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 235 transitions. [2022-04-15 13:17:33,342 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 13:17:33,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 235 transitions. [2022-04-15 13:17:33,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 235 transitions. [2022-04-15 13:17:33,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:33,561 INFO L225 Difference]: With dead ends: 174 [2022-04-15 13:17:33,561 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 13:17:33,564 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 13:17:33,566 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 150 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:33,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 97 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 13:17:33,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 13:17:33,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2022-04-15 13:17:33,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:33,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 91 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 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 13:17:33,596 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 91 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 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 13:17:33,597 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 91 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 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 13:17:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:33,603 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2022-04-15 13:17:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2022-04-15 13:17:33,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:33,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:33,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 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 98 states. [2022-04-15 13:17:33,618 INFO L87 Difference]: Start difference. First operand has 91 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 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 98 states. [2022-04-15 13:17:33,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:33,623 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2022-04-15 13:17:33,623 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2022-04-15 13:17:33,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:33,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:33,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:33,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 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 13:17:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2022-04-15 13:17:33,637 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 44 [2022-04-15 13:17:33,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:33,637 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2022-04-15 13:17:33,639 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 13:17:33,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 115 transitions. [2022-04-15 13:17:33,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:33,753 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2022-04-15 13:17:33,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 13:17:33,764 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:33,765 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 13:17:33,765 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:17:33,765 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:33,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:33,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1232690542, now seen corresponding path program 1 times [2022-04-15 13:17:33,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:33,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1469865488] [2022-04-15 13:17:33,767 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:17:33,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1232690542, now seen corresponding path program 2 times [2022-04-15 13:17:33,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:33,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592059859] [2022-04-15 13:17:33,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:33,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:33,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:17:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:33,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {923#(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(16, 2);call #Ultimate.allocInit(12, 3); {881#true} is VALID [2022-04-15 13:17:33,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:33,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {881#true} {881#true} #197#return; {881#true} is VALID [2022-04-15 13:17:33,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 13:17:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:33,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {924#(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; {925#(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 13:17:33,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {925#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {925#(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 13:17:33,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {925#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} {881#true} #155#return; {889#(and (= |main_#t~ret45.offset| 0) (= |main_#t~ret45.base| 0))} is VALID [2022-04-15 13:17:33,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:17:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:33,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {881#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {881#true} is VALID [2022-04-15 13:17:33,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {881#true} is VALID [2022-04-15 13:17:33,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:33,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {891#(and (= task_~t.offset 0) (= task_~t.base 0))} #167#return; {891#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-15 13:17:33,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 13:17:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:33,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 13:17:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:33,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {881#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {881#true} is VALID [2022-04-15 13:17:33,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {881#true} is VALID [2022-04-15 13:17:33,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:33,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {927#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} #193#return; {927#(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 13:17:33,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-15 13:17:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:33,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {881#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {881#true} is VALID [2022-04-15 13:17:33,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {881#true} is VALID [2022-04-15 13:17:33,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:33,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} #195#return; {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:33,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {881#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {926#(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 13:17:33,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {926#(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~mem28.base, #t~mem28.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {927#(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 13:17:33,983 INFO L272 TraceCheckUtils]: 2: Hoare triple {927#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} call #t~ret29 := size(#t~mem28.base, #t~mem28.offset); {881#true} is VALID [2022-04-15 13:17:33,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {881#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {881#true} is VALID [2022-04-15 13:17:33,983 INFO L290 TraceCheckUtils]: 4: Hoare triple {881#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {881#true} is VALID [2022-04-15 13:17:33,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:33,984 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {881#true} {927#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} #193#return; {927#(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 13:17:33,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {927#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:33,985 INFO L272 TraceCheckUtils]: 8: Hoare triple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} call #t~ret31 := size(#t~mem30.base, #t~mem30.offset); {881#true} is VALID [2022-04-15 13:17:33,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {881#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {881#true} is VALID [2022-04-15 13:17:33,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {881#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {881#true} is VALID [2022-04-15 13:17:33,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:33,986 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {881#true} {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} #195#return; {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:33,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;#res := 1 + (#t~ret29 + #t~ret31);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29;havoc #t~mem30.base, #t~mem30.offset;havoc #t~ret31; {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:33,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume true; {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:33,989 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} {891#(and (= task_~t.offset 0) (= task_~t.base 0))} #169#return; {882#false} is VALID [2022-04-15 13:17:33,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-15 13:17:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:33,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {881#true} ~cond := #in~cond; {881#true} is VALID [2022-04-15 13:17:33,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#true} assume !(0 == ~cond); {881#true} is VALID [2022-04-15 13:17:33,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:33,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {882#false} #171#return; {882#false} is VALID [2022-04-15 13:17:34,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-15 13:17:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:34,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {937#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {881#true} is VALID [2022-04-15 13:17:34,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,009 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {881#true} {882#false} #173#return; {882#false} is VALID [2022-04-15 13:17:34,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 13:17:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:34,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {938#(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; {881#true} is VALID [2022-04-15 13:17:34,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {881#true} is VALID [2022-04-15 13:17:34,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {882#false} #175#return; {882#false} is VALID [2022-04-15 13:17:34,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {881#true} call ULTIMATE.init(); {923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:17:34,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {923#(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(16, 2);call #Ultimate.allocInit(12, 3); {881#true} is VALID [2022-04-15 13:17:34,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {881#true} #197#return; {881#true} is VALID [2022-04-15 13:17:34,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {881#true} call #t~ret46 := main(); {881#true} is VALID [2022-04-15 13:17:34,043 INFO L272 TraceCheckUtils]: 5: Hoare triple {881#true} call #t~ret45.base, #t~ret45.offset := nondet_tree(); {924#(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 13:17:34,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {924#(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; {925#(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 13:17:34,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {925#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {925#(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 13:17:34,045 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {925#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} {881#true} #155#return; {889#(and (= |main_#t~ret45.offset| 0) (= |main_#t~ret45.base| 0))} is VALID [2022-04-15 13:17:34,046 INFO L272 TraceCheckUtils]: 9: Hoare triple {889#(and (= |main_#t~ret45.offset| 0) (= |main_#t~ret45.base| 0))} call task(#t~ret45.base, #t~ret45.offset); {890#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} is VALID [2022-04-15 13:17:34,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {890#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {891#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-15 13:17:34,046 INFO L272 TraceCheckUtils]: 11: Hoare triple {891#(and (= task_~t.offset 0) (= task_~t.base 0))} call #t~ret32 := min(~t.base, ~t.offset); {881#true} is VALID [2022-04-15 13:17:34,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {881#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {881#true} is VALID [2022-04-15 13:17:34,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {881#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {881#true} is VALID [2022-04-15 13:17:34,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,047 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {881#true} {891#(and (= task_~t.offset 0) (= task_~t.base 0))} #167#return; {891#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-15 13:17:34,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {891#(and (= task_~t.offset 0) (= task_~t.base 0))} assume -2147483648 <= #t~ret32 && #t~ret32 <= 2147483647;~a~1 := #t~ret32;havoc #t~ret32;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {891#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-15 13:17:34,047 INFO L272 TraceCheckUtils]: 17: Hoare triple {891#(and (= task_~t.offset 0) (= task_~t.base 0))} call #t~ret33 := size(~t.base, ~t.offset); {881#true} is VALID [2022-04-15 13:17:34,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {926#(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 13:17:34,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {926#(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~mem28.base, #t~mem28.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {927#(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 13:17:34,048 INFO L272 TraceCheckUtils]: 20: Hoare triple {927#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} call #t~ret29 := size(#t~mem28.base, #t~mem28.offset); {881#true} is VALID [2022-04-15 13:17:34,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {881#true} is VALID [2022-04-15 13:17:34,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {881#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {881#true} is VALID [2022-04-15 13:17:34,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,049 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {881#true} {927#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} #193#return; {927#(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 13:17:34,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {927#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:34,050 INFO L272 TraceCheckUtils]: 26: Hoare triple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} call #t~ret31 := size(#t~mem30.base, #t~mem30.offset); {881#true} is VALID [2022-04-15 13:17:34,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {881#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {881#true} is VALID [2022-04-15 13:17:34,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {881#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {881#true} is VALID [2022-04-15 13:17:34,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,054 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {881#true} {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} #195#return; {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:34,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;#res := 1 + (#t~ret29 + #t~ret31);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29;havoc #t~mem30.base, #t~mem30.offset;havoc #t~ret31; {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:34,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume true; {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:34,055 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} {891#(and (= task_~t.offset 0) (= task_~t.base 0))} #169#return; {882#false} is VALID [2022-04-15 13:17:34,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {882#false} assume -2147483648 <= #t~ret33 && #t~ret33 <= 2147483647;~n~1 := #t~ret33;havoc #t~ret33; {882#false} is VALID [2022-04-15 13:17:34,055 INFO L272 TraceCheckUtils]: 35: Hoare triple {882#false} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {881#true} is VALID [2022-04-15 13:17:34,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {881#true} ~cond := #in~cond; {881#true} is VALID [2022-04-15 13:17:34,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {881#true} assume !(0 == ~cond); {881#true} is VALID [2022-04-15 13:17:34,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,056 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {881#true} {882#false} #171#return; {882#false} is VALID [2022-04-15 13:17:34,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {882#false} call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4 * ~n~1); {882#false} is VALID [2022-04-15 13:17:34,056 INFO L272 TraceCheckUtils]: 41: Hoare triple {882#false} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, ~n~1, 4, 4 * ~n~1); {937#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:34,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {937#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {881#true} is VALID [2022-04-15 13:17:34,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,056 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {881#true} {882#false} #173#return; {882#false} is VALID [2022-04-15 13:17:34,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {882#false} ~x~0.base, ~x~0.offset := #t~malloc34.base, #t~malloc34.offset; {882#false} is VALID [2022-04-15 13:17:34,056 INFO L272 TraceCheckUtils]: 46: Hoare triple {882#false} call #t~ret35 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {938#(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 13:17:34,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {938#(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; {881#true} is VALID [2022-04-15 13:17:34,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {881#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {881#true} is VALID [2022-04-15 13:17:34,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,057 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {881#true} {882#false} #175#return; {882#false} is VALID [2022-04-15 13:17:34,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {882#false} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;call #t~mem36 := read~int(~x~0.base, ~x~0.offset, 4); {882#false} is VALID [2022-04-15 13:17:34,057 INFO L272 TraceCheckUtils]: 52: Hoare triple {882#false} call __VERIFIER_assert((if ~a~1 == #t~mem36 then 1 else 0)); {882#false} is VALID [2022-04-15 13:17:34,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {882#false} ~cond := #in~cond; {882#false} is VALID [2022-04-15 13:17:34,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {882#false} assume 0 == ~cond; {882#false} is VALID [2022-04-15 13:17:34,057 INFO L290 TraceCheckUtils]: 55: Hoare triple {882#false} assume !false; {882#false} is VALID [2022-04-15 13:17:34,057 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 13:17:34,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:34,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592059859] [2022-04-15 13:17:34,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592059859] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:17:34,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190919714] [2022-04-15 13:17:34,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:17:34,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:34,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:17:34,060 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 13:17:34,061 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 13:17:34,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:17:34,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:17:34,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 13:17:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:34,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:17:34,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {881#true} call ULTIMATE.init(); {881#true} is VALID [2022-04-15 13:17:34,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {881#true} is VALID [2022-04-15 13:17:34,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {881#true} #197#return; {881#true} is VALID [2022-04-15 13:17:34,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {881#true} call #t~ret46 := main(); {881#true} is VALID [2022-04-15 13:17:34,547 INFO L272 TraceCheckUtils]: 5: Hoare triple {881#true} call #t~ret45.base, #t~ret45.offset := nondet_tree(); {881#true} is VALID [2022-04-15 13:17:34,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#true} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {925#(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 13:17:34,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {925#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {925#(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 13:17:34,549 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {925#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} {881#true} #155#return; {889#(and (= |main_#t~ret45.offset| 0) (= |main_#t~ret45.base| 0))} is VALID [2022-04-15 13:17:34,549 INFO L272 TraceCheckUtils]: 9: Hoare triple {889#(and (= |main_#t~ret45.offset| 0) (= |main_#t~ret45.base| 0))} call task(#t~ret45.base, #t~ret45.offset); {890#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} is VALID [2022-04-15 13:17:34,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {890#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {891#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-15 13:17:34,550 INFO L272 TraceCheckUtils]: 11: Hoare triple {891#(and (= task_~t.offset 0) (= task_~t.base 0))} call #t~ret32 := min(~t.base, ~t.offset); {881#true} is VALID [2022-04-15 13:17:34,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {881#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {881#true} is VALID [2022-04-15 13:17:34,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {881#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {881#true} is VALID [2022-04-15 13:17:34,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,551 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {881#true} {891#(and (= task_~t.offset 0) (= task_~t.base 0))} #167#return; {891#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-15 13:17:34,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {891#(and (= task_~t.offset 0) (= task_~t.base 0))} assume -2147483648 <= #t~ret32 && #t~ret32 <= 2147483647;~a~1 := #t~ret32;havoc #t~ret32;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {891#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-15 13:17:34,552 INFO L272 TraceCheckUtils]: 17: Hoare triple {891#(and (= task_~t.offset 0) (= task_~t.base 0))} call #t~ret33 := size(~t.base, ~t.offset); {881#true} is VALID [2022-04-15 13:17:34,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {996#(and (= |size_#in~t.offset| size_~t.offset) (= |size_#in~t.base| size_~t.base))} is VALID [2022-04-15 13:17:34,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {996#(and (= |size_#in~t.offset| size_~t.offset) (= |size_#in~t.base| size_~t.base))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:34,553 INFO L272 TraceCheckUtils]: 20: Hoare triple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} call #t~ret29 := size(#t~mem28.base, #t~mem28.offset); {881#true} is VALID [2022-04-15 13:17:34,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {881#true} is VALID [2022-04-15 13:17:34,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {881#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {881#true} is VALID [2022-04-15 13:17:34,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,554 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {881#true} {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} #193#return; {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:34,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:34,554 INFO L272 TraceCheckUtils]: 26: Hoare triple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} call #t~ret31 := size(#t~mem30.base, #t~mem30.offset); {881#true} is VALID [2022-04-15 13:17:34,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {881#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {881#true} is VALID [2022-04-15 13:17:34,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {881#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {881#true} is VALID [2022-04-15 13:17:34,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,555 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {881#true} {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} #195#return; {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:34,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;#res := 1 + (#t~ret29 + #t~ret31);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29;havoc #t~mem30.base, #t~mem30.offset;havoc #t~ret31; {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:34,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume true; {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:34,558 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} {891#(and (= task_~t.offset 0) (= task_~t.base 0))} #169#return; {882#false} is VALID [2022-04-15 13:17:34,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {882#false} assume -2147483648 <= #t~ret33 && #t~ret33 <= 2147483647;~n~1 := #t~ret33;havoc #t~ret33; {882#false} is VALID [2022-04-15 13:17:34,558 INFO L272 TraceCheckUtils]: 35: Hoare triple {882#false} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {882#false} is VALID [2022-04-15 13:17:34,558 INFO L290 TraceCheckUtils]: 36: Hoare triple {882#false} ~cond := #in~cond; {882#false} is VALID [2022-04-15 13:17:34,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {882#false} assume !(0 == ~cond); {882#false} is VALID [2022-04-15 13:17:34,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {882#false} assume true; {882#false} is VALID [2022-04-15 13:17:34,559 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {882#false} {882#false} #171#return; {882#false} is VALID [2022-04-15 13:17:34,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {882#false} call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4 * ~n~1); {882#false} is VALID [2022-04-15 13:17:34,559 INFO L272 TraceCheckUtils]: 41: Hoare triple {882#false} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, ~n~1, 4, 4 * ~n~1); {882#false} is VALID [2022-04-15 13:17:34,559 INFO L290 TraceCheckUtils]: 42: Hoare triple {882#false} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {882#false} is VALID [2022-04-15 13:17:34,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {882#false} assume true; {882#false} is VALID [2022-04-15 13:17:34,559 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {882#false} {882#false} #173#return; {882#false} is VALID [2022-04-15 13:17:34,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {882#false} ~x~0.base, ~x~0.offset := #t~malloc34.base, #t~malloc34.offset; {882#false} is VALID [2022-04-15 13:17:34,559 INFO L272 TraceCheckUtils]: 46: Hoare triple {882#false} call #t~ret35 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {882#false} is VALID [2022-04-15 13:17:34,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {882#false} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {882#false} is VALID [2022-04-15 13:17:34,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {882#false} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {882#false} is VALID [2022-04-15 13:17:34,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {882#false} assume true; {882#false} is VALID [2022-04-15 13:17:34,560 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {882#false} {882#false} #175#return; {882#false} is VALID [2022-04-15 13:17:34,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {882#false} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;call #t~mem36 := read~int(~x~0.base, ~x~0.offset, 4); {882#false} is VALID [2022-04-15 13:17:34,560 INFO L272 TraceCheckUtils]: 52: Hoare triple {882#false} call __VERIFIER_assert((if ~a~1 == #t~mem36 then 1 else 0)); {882#false} is VALID [2022-04-15 13:17:34,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {882#false} ~cond := #in~cond; {882#false} is VALID [2022-04-15 13:17:34,560 INFO L290 TraceCheckUtils]: 54: Hoare triple {882#false} assume 0 == ~cond; {882#false} is VALID [2022-04-15 13:17:34,560 INFO L290 TraceCheckUtils]: 55: Hoare triple {882#false} assume !false; {882#false} is VALID [2022-04-15 13:17:34,561 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 13:17:34,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:17:34,883 INFO L290 TraceCheckUtils]: 55: Hoare triple {882#false} assume !false; {882#false} is VALID [2022-04-15 13:17:34,883 INFO L290 TraceCheckUtils]: 54: Hoare triple {882#false} assume 0 == ~cond; {882#false} is VALID [2022-04-15 13:17:34,883 INFO L290 TraceCheckUtils]: 53: Hoare triple {882#false} ~cond := #in~cond; {882#false} is VALID [2022-04-15 13:17:34,884 INFO L272 TraceCheckUtils]: 52: Hoare triple {882#false} call __VERIFIER_assert((if ~a~1 == #t~mem36 then 1 else 0)); {882#false} is VALID [2022-04-15 13:17:34,884 INFO L290 TraceCheckUtils]: 51: Hoare triple {882#false} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;call #t~mem36 := read~int(~x~0.base, ~x~0.offset, 4); {882#false} is VALID [2022-04-15 13:17:34,884 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {881#true} {882#false} #175#return; {882#false} is VALID [2022-04-15 13:17:34,884 INFO L290 TraceCheckUtils]: 49: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,884 INFO L290 TraceCheckUtils]: 48: Hoare triple {881#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {881#true} is VALID [2022-04-15 13:17:34,884 INFO L290 TraceCheckUtils]: 47: Hoare triple {881#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {881#true} is VALID [2022-04-15 13:17:34,884 INFO L272 TraceCheckUtils]: 46: Hoare triple {882#false} call #t~ret35 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {881#true} is VALID [2022-04-15 13:17:34,884 INFO L290 TraceCheckUtils]: 45: Hoare triple {882#false} ~x~0.base, ~x~0.offset := #t~malloc34.base, #t~malloc34.offset; {882#false} is VALID [2022-04-15 13:17:34,884 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {881#true} {882#false} #173#return; {882#false} is VALID [2022-04-15 13:17:34,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {881#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {881#true} is VALID [2022-04-15 13:17:34,884 INFO L272 TraceCheckUtils]: 41: Hoare triple {882#false} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, ~n~1, 4, 4 * ~n~1); {881#true} is VALID [2022-04-15 13:17:34,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {882#false} call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4 * ~n~1); {882#false} is VALID [2022-04-15 13:17:34,885 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {881#true} {882#false} #171#return; {882#false} is VALID [2022-04-15 13:17:34,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {881#true} assume !(0 == ~cond); {881#true} is VALID [2022-04-15 13:17:34,890 INFO L290 TraceCheckUtils]: 36: Hoare triple {881#true} ~cond := #in~cond; {881#true} is VALID [2022-04-15 13:17:34,892 INFO L272 TraceCheckUtils]: 35: Hoare triple {882#false} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {881#true} is VALID [2022-04-15 13:17:34,893 INFO L290 TraceCheckUtils]: 34: Hoare triple {882#false} assume -2147483648 <= #t~ret33 && #t~ret33 <= 2147483647;~n~1 := #t~ret33;havoc #t~ret33; {882#false} is VALID [2022-04-15 13:17:34,894 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} {891#(and (= task_~t.offset 0) (= task_~t.base 0))} #169#return; {882#false} is VALID [2022-04-15 13:17:34,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume true; {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:34,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;#res := 1 + (#t~ret29 + #t~ret31);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29;havoc #t~mem30.base, #t~mem30.offset;havoc #t~ret31; {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:34,896 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {881#true} {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} #195#return; {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:34,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {881#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {881#true} is VALID [2022-04-15 13:17:34,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {881#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {881#true} is VALID [2022-04-15 13:17:34,899 INFO L272 TraceCheckUtils]: 26: Hoare triple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} call #t~ret31 := size(#t~mem30.base, #t~mem30.offset); {881#true} is VALID [2022-04-15 13:17:34,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:34,902 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {881#true} {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} #193#return; {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:34,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {881#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {881#true} is VALID [2022-04-15 13:17:34,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {881#true} is VALID [2022-04-15 13:17:34,903 INFO L272 TraceCheckUtils]: 20: Hoare triple {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} call #t~ret29 := size(#t~mem28.base, #t~mem28.offset); {881#true} is VALID [2022-04-15 13:17:34,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {1219#(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~mem28.base, #t~mem28.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {932#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-15 13:17:34,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1219#(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 13:17:34,904 INFO L272 TraceCheckUtils]: 17: Hoare triple {891#(and (= task_~t.offset 0) (= task_~t.base 0))} call #t~ret33 := size(~t.base, ~t.offset); {881#true} is VALID [2022-04-15 13:17:34,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {891#(and (= task_~t.offset 0) (= task_~t.base 0))} assume -2147483648 <= #t~ret32 && #t~ret32 <= 2147483647;~a~1 := #t~ret32;havoc #t~ret32;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {891#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-15 13:17:34,905 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {881#true} {891#(and (= task_~t.offset 0) (= task_~t.base 0))} #167#return; {891#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-15 13:17:34,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {881#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {881#true} is VALID [2022-04-15 13:17:34,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {881#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {881#true} is VALID [2022-04-15 13:17:34,905 INFO L272 TraceCheckUtils]: 11: Hoare triple {891#(and (= task_~t.offset 0) (= task_~t.base 0))} call #t~ret32 := min(~t.base, ~t.offset); {881#true} is VALID [2022-04-15 13:17:34,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {890#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {891#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-15 13:17:34,906 INFO L272 TraceCheckUtils]: 9: Hoare triple {889#(and (= |main_#t~ret45.offset| 0) (= |main_#t~ret45.base| 0))} call task(#t~ret45.base, #t~ret45.offset); {890#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} is VALID [2022-04-15 13:17:34,906 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {925#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} {881#true} #155#return; {889#(and (= |main_#t~ret45.offset| 0) (= |main_#t~ret45.base| 0))} is VALID [2022-04-15 13:17:34,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {925#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {925#(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 13:17:34,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#true} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {925#(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 13:17:34,907 INFO L272 TraceCheckUtils]: 5: Hoare triple {881#true} call #t~ret45.base, #t~ret45.offset := nondet_tree(); {881#true} is VALID [2022-04-15 13:17:34,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {881#true} call #t~ret46 := main(); {881#true} is VALID [2022-04-15 13:17:34,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {881#true} #197#return; {881#true} is VALID [2022-04-15 13:17:34,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 13:17:34,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {881#true} is VALID [2022-04-15 13:17:34,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {881#true} call ULTIMATE.init(); {881#true} is VALID [2022-04-15 13:17:34,909 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 13:17:34,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190919714] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:17:34,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:17:34,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 15 [2022-04-15 13:17:34,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:34,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1469865488] [2022-04-15 13:17:34,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1469865488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:34,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:34,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 13:17:34,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742734746] [2022-04-15 13:17:34,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:34,912 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 13:17:34,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:34,914 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 13:17:34,947 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 13:17:34,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 13:17:34,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:34,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 13:17:34,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:17:34,950 INFO L87 Difference]: Start difference. First operand 91 states and 115 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 13:17:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:37,130 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2022-04-15 13:17:37,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 13:17:37,130 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 13:17:37,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:37,131 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 13:17:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 207 transitions. [2022-04-15 13:17:37,135 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 13:17:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 207 transitions. [2022-04-15 13:17:37,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 207 transitions. [2022-04-15 13:17:37,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:37,312 INFO L225 Difference]: With dead ends: 165 [2022-04-15 13:17:37,312 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 13:17:37,313 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 13:17:37,313 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 107 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:37,314 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 84 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 13:17:37,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 13:17:37,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-04-15 13:17:37,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:37,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 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 13:17:37,340 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 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 13:17:37,341 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 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 13:17:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:37,348 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-15 13:17:37,348 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2022-04-15 13:17:37,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:37,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:37,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 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 97 states. [2022-04-15 13:17:37,351 INFO L87 Difference]: Start difference. First operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 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 97 states. [2022-04-15 13:17:37,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:37,358 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-15 13:17:37,358 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2022-04-15 13:17:37,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:37,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:37,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:37,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 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 13:17:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2022-04-15 13:17:37,367 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 56 [2022-04-15 13:17:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:37,368 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2022-04-15 13:17:37,369 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 13:17:37,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 118 transitions. [2022-04-15 13:17:37,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:37,480 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2022-04-15 13:17:37,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 13:17:37,481 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:37,481 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 13:17:37,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 13:17:37,685 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:37,686 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:37,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1976466705, now seen corresponding path program 1 times [2022-04-15 13:17:37,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:37,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1534706432] [2022-04-15 13:17:37,687 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:17:37,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1976466705, now seen corresponding path program 2 times [2022-04-15 13:17:37,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:37,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699015121] [2022-04-15 13:17:37,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:37,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:37,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:17:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:37,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {2058#(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(16, 2);call #Ultimate.allocInit(12, 3); {2006#true} is VALID [2022-04-15 13:17:37,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2006#true} {2006#true} #197#return; {2006#true} is VALID [2022-04-15 13:17:37,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 13:17:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:37,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 13:17:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:37,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {2059#(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; {2006#true} is VALID [2022-04-15 13:17:37,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2006#true} {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} #163#return; {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-04-15 13:17:37,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:17:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:37,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {2059#(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; {2006#true} is VALID [2022-04-15 13:17:37,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2006#true} {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} #165#return; {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-04-15 13:17:37,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {2059#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume !(0 != #t~nondet5 % 256);havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(20);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet7; {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-04-15 13:17:37,844 INFO L272 TraceCheckUtils]: 1: Hoare triple {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} call #t~ret8.base, #t~ret8.offset := nondet_tree(); {2059#(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 13:17:37,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {2059#(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; {2006#true} is VALID [2022-04-15 13:17:37,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,845 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2006#true} {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} #163#return; {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-04-15 13:17:37,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~n~0.base, 4 + ~n~0.offset, 8);havoc #t~ret8.base, #t~ret8.offset; {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-04-15 13:17:37,846 INFO L272 TraceCheckUtils]: 6: Hoare triple {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} call #t~ret9.base, #t~ret9.offset := nondet_tree(); {2059#(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 13:17:37,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {2059#(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; {2006#true} is VALID [2022-04-15 13:17:37,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,847 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2006#true} {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} #165#return; {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-04-15 13:17:37,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} call write~$Pointer$(#t~ret9.base, #t~ret9.offset, ~n~0.base, 12 + ~n~0.offset, 8);havoc #t~ret9.base, #t~ret9.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2067#(or (<= 1 |nondet_tree_#res.base|) (<= (+ |nondet_tree_#res.base| 1) 0))} is VALID [2022-04-15 13:17:37,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {2067#(or (<= 1 |nondet_tree_#res.base|) (<= (+ |nondet_tree_#res.base| 1) 0))} assume true; {2067#(or (<= 1 |nondet_tree_#res.base|) (<= (+ |nondet_tree_#res.base| 1) 0))} is VALID [2022-04-15 13:17:37,848 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2067#(or (<= 1 |nondet_tree_#res.base|) (<= (+ |nondet_tree_#res.base| 1) 0))} {2006#true} #155#return; {2024#(not (= |main_#t~ret45.base| 0))} is VALID [2022-04-15 13:17:37,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 13:17:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:37,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {2006#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2068#(= min_~n.base |min_#in~n.base|)} is VALID [2022-04-15 13:17:37,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {2068#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2069#(= |min_#in~n.base| 0)} is VALID [2022-04-15 13:17:37,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {2069#(= |min_#in~n.base| 0)} assume true; {2069#(= |min_#in~n.base| 0)} is VALID [2022-04-15 13:17:37,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2069#(= |min_#in~n.base| 0)} {2026#(not (= task_~t.base 0))} #167#return; {2007#false} is VALID [2022-04-15 13:17:37,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 13:17:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:37,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 13:17:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:37,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {2006#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2006#true} is VALID [2022-04-15 13:17:37,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {2006#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2006#true} is VALID [2022-04-15 13:17:37,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2006#true} {2006#true} #193#return; {2006#true} is VALID [2022-04-15 13:17:37,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-15 13:17:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:37,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {2006#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2006#true} is VALID [2022-04-15 13:17:37,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {2006#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2006#true} is VALID [2022-04-15 13:17:37,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2006#true} {2006#true} #195#return; {2006#true} is VALID [2022-04-15 13:17:37,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {2006#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2006#true} is VALID [2022-04-15 13:17:37,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {2006#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {2006#true} is VALID [2022-04-15 13:17:37,933 INFO L272 TraceCheckUtils]: 2: Hoare triple {2006#true} call #t~ret29 := size(#t~mem28.base, #t~mem28.offset); {2006#true} is VALID [2022-04-15 13:17:37,933 INFO L290 TraceCheckUtils]: 3: Hoare triple {2006#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2006#true} is VALID [2022-04-15 13:17:37,933 INFO L290 TraceCheckUtils]: 4: Hoare triple {2006#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2006#true} is VALID [2022-04-15 13:17:37,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,933 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2006#true} {2006#true} #193#return; {2006#true} is VALID [2022-04-15 13:17:37,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {2006#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {2006#true} is VALID [2022-04-15 13:17:37,933 INFO L272 TraceCheckUtils]: 8: Hoare triple {2006#true} call #t~ret31 := size(#t~mem30.base, #t~mem30.offset); {2006#true} is VALID [2022-04-15 13:17:37,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {2006#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2006#true} is VALID [2022-04-15 13:17:37,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {2006#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2006#true} is VALID [2022-04-15 13:17:37,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,933 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2006#true} {2006#true} #195#return; {2006#true} is VALID [2022-04-15 13:17:37,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {2006#true} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;#res := 1 + (#t~ret29 + #t~ret31);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29;havoc #t~mem30.base, #t~mem30.offset;havoc #t~ret31; {2006#true} is VALID [2022-04-15 13:17:37,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,934 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2006#true} {2007#false} #169#return; {2007#false} is VALID [2022-04-15 13:17:37,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-15 13:17:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:37,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {2006#true} ~cond := #in~cond; {2006#true} is VALID [2022-04-15 13:17:37,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {2006#true} assume !(0 == ~cond); {2006#true} is VALID [2022-04-15 13:17:37,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2006#true} {2007#false} #171#return; {2007#false} is VALID [2022-04-15 13:17:37,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-15 13:17:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:37,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {2078#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2006#true} is VALID [2022-04-15 13:17:37,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2006#true} {2007#false} #173#return; {2007#false} is VALID [2022-04-15 13:17:37,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-15 13:17:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:37,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {2079#(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; {2006#true} is VALID [2022-04-15 13:17:37,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {2006#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2006#true} is VALID [2022-04-15 13:17:37,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2006#true} {2007#false} #175#return; {2007#false} is VALID [2022-04-15 13:17:37,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {2006#true} call ULTIMATE.init(); {2058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:17:37,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {2058#(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(16, 2);call #Ultimate.allocInit(12, 3); {2006#true} is VALID [2022-04-15 13:17:37,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2006#true} {2006#true} #197#return; {2006#true} is VALID [2022-04-15 13:17:37,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {2006#true} call #t~ret46 := main(); {2006#true} is VALID [2022-04-15 13:17:37,968 INFO L272 TraceCheckUtils]: 5: Hoare triple {2006#true} call #t~ret45.base, #t~ret45.offset := nondet_tree(); {2059#(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 13:17:37,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {2059#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume !(0 != #t~nondet5 % 256);havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(20);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet7; {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-04-15 13:17:37,969 INFO L272 TraceCheckUtils]: 7: Hoare triple {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} call #t~ret8.base, #t~ret8.offset := nondet_tree(); {2059#(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 13:17:37,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {2059#(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; {2006#true} is VALID [2022-04-15 13:17:37,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,970 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2006#true} {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} #163#return; {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-04-15 13:17:37,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~n~0.base, 4 + ~n~0.offset, 8);havoc #t~ret8.base, #t~ret8.offset; {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-04-15 13:17:37,971 INFO L272 TraceCheckUtils]: 12: Hoare triple {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} call #t~ret9.base, #t~ret9.offset := nondet_tree(); {2059#(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 13:17:37,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {2059#(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; {2006#true} is VALID [2022-04-15 13:17:37,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,971 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2006#true} {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} #165#return; {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-04-15 13:17:37,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {2060#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} call write~$Pointer$(#t~ret9.base, #t~ret9.offset, ~n~0.base, 12 + ~n~0.offset, 8);havoc #t~ret9.base, #t~ret9.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2067#(or (<= 1 |nondet_tree_#res.base|) (<= (+ |nondet_tree_#res.base| 1) 0))} is VALID [2022-04-15 13:17:37,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {2067#(or (<= 1 |nondet_tree_#res.base|) (<= (+ |nondet_tree_#res.base| 1) 0))} assume true; {2067#(or (<= 1 |nondet_tree_#res.base|) (<= (+ |nondet_tree_#res.base| 1) 0))} is VALID [2022-04-15 13:17:37,973 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2067#(or (<= 1 |nondet_tree_#res.base|) (<= (+ |nondet_tree_#res.base| 1) 0))} {2006#true} #155#return; {2024#(not (= |main_#t~ret45.base| 0))} is VALID [2022-04-15 13:17:37,973 INFO L272 TraceCheckUtils]: 19: Hoare triple {2024#(not (= |main_#t~ret45.base| 0))} call task(#t~ret45.base, #t~ret45.offset); {2025#(not (= |task_#in~t.base| 0))} is VALID [2022-04-15 13:17:37,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {2025#(not (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2026#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:37,974 INFO L272 TraceCheckUtils]: 21: Hoare triple {2026#(not (= task_~t.base 0))} call #t~ret32 := min(~t.base, ~t.offset); {2006#true} is VALID [2022-04-15 13:17:37,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {2006#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2068#(= min_~n.base |min_#in~n.base|)} is VALID [2022-04-15 13:17:37,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {2068#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2069#(= |min_#in~n.base| 0)} is VALID [2022-04-15 13:17:37,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {2069#(= |min_#in~n.base| 0)} assume true; {2069#(= |min_#in~n.base| 0)} is VALID [2022-04-15 13:17:37,975 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2069#(= |min_#in~n.base| 0)} {2026#(not (= task_~t.base 0))} #167#return; {2007#false} is VALID [2022-04-15 13:17:37,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {2007#false} assume -2147483648 <= #t~ret32 && #t~ret32 <= 2147483647;~a~1 := #t~ret32;havoc #t~ret32;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2007#false} is VALID [2022-04-15 13:17:37,976 INFO L272 TraceCheckUtils]: 27: Hoare triple {2007#false} call #t~ret33 := size(~t.base, ~t.offset); {2006#true} is VALID [2022-04-15 13:17:37,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {2006#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2006#true} is VALID [2022-04-15 13:17:37,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {2006#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {2006#true} is VALID [2022-04-15 13:17:37,978 INFO L272 TraceCheckUtils]: 30: Hoare triple {2006#true} call #t~ret29 := size(#t~mem28.base, #t~mem28.offset); {2006#true} is VALID [2022-04-15 13:17:37,979 INFO L290 TraceCheckUtils]: 31: Hoare triple {2006#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2006#true} is VALID [2022-04-15 13:17:37,979 INFO L290 TraceCheckUtils]: 32: Hoare triple {2006#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2006#true} is VALID [2022-04-15 13:17:37,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,979 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2006#true} {2006#true} #193#return; {2006#true} is VALID [2022-04-15 13:17:37,979 INFO L290 TraceCheckUtils]: 35: Hoare triple {2006#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {2006#true} is VALID [2022-04-15 13:17:37,979 INFO L272 TraceCheckUtils]: 36: Hoare triple {2006#true} call #t~ret31 := size(#t~mem30.base, #t~mem30.offset); {2006#true} is VALID [2022-04-15 13:17:37,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {2006#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2006#true} is VALID [2022-04-15 13:17:37,980 INFO L290 TraceCheckUtils]: 38: Hoare triple {2006#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2006#true} is VALID [2022-04-15 13:17:37,980 INFO L290 TraceCheckUtils]: 39: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,980 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2006#true} {2006#true} #195#return; {2006#true} is VALID [2022-04-15 13:17:37,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {2006#true} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;#res := 1 + (#t~ret29 + #t~ret31);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29;havoc #t~mem30.base, #t~mem30.offset;havoc #t~ret31; {2006#true} is VALID [2022-04-15 13:17:37,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,980 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2006#true} {2007#false} #169#return; {2007#false} is VALID [2022-04-15 13:17:37,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {2007#false} assume -2147483648 <= #t~ret33 && #t~ret33 <= 2147483647;~n~1 := #t~ret33;havoc #t~ret33; {2007#false} is VALID [2022-04-15 13:17:37,980 INFO L272 TraceCheckUtils]: 45: Hoare triple {2007#false} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {2006#true} is VALID [2022-04-15 13:17:37,980 INFO L290 TraceCheckUtils]: 46: Hoare triple {2006#true} ~cond := #in~cond; {2006#true} is VALID [2022-04-15 13:17:37,980 INFO L290 TraceCheckUtils]: 47: Hoare triple {2006#true} assume !(0 == ~cond); {2006#true} is VALID [2022-04-15 13:17:37,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,980 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2006#true} {2007#false} #171#return; {2007#false} is VALID [2022-04-15 13:17:37,980 INFO L290 TraceCheckUtils]: 50: Hoare triple {2007#false} call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2007#false} is VALID [2022-04-15 13:17:37,980 INFO L272 TraceCheckUtils]: 51: Hoare triple {2007#false} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, ~n~1, 4, 4 * ~n~1); {2078#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:37,981 INFO L290 TraceCheckUtils]: 52: Hoare triple {2078#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2006#true} is VALID [2022-04-15 13:17:37,981 INFO L290 TraceCheckUtils]: 53: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,981 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {2006#true} {2007#false} #173#return; {2007#false} is VALID [2022-04-15 13:17:37,981 INFO L290 TraceCheckUtils]: 55: Hoare triple {2007#false} ~x~0.base, ~x~0.offset := #t~malloc34.base, #t~malloc34.offset; {2007#false} is VALID [2022-04-15 13:17:37,981 INFO L272 TraceCheckUtils]: 56: Hoare triple {2007#false} call #t~ret35 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2079#(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 13:17:37,981 INFO L290 TraceCheckUtils]: 57: Hoare triple {2079#(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; {2006#true} is VALID [2022-04-15 13:17:37,981 INFO L290 TraceCheckUtils]: 58: Hoare triple {2006#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2006#true} is VALID [2022-04-15 13:17:37,981 INFO L290 TraceCheckUtils]: 59: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-15 13:17:37,981 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2006#true} {2007#false} #175#return; {2007#false} is VALID [2022-04-15 13:17:37,981 INFO L290 TraceCheckUtils]: 61: Hoare triple {2007#false} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;call #t~mem36 := read~int(~x~0.base, ~x~0.offset, 4); {2007#false} is VALID [2022-04-15 13:17:37,981 INFO L272 TraceCheckUtils]: 62: Hoare triple {2007#false} call __VERIFIER_assert((if ~a~1 == #t~mem36 then 1 else 0)); {2007#false} is VALID [2022-04-15 13:17:37,981 INFO L290 TraceCheckUtils]: 63: Hoare triple {2007#false} ~cond := #in~cond; {2007#false} is VALID [2022-04-15 13:17:37,981 INFO L290 TraceCheckUtils]: 64: Hoare triple {2007#false} assume 0 == ~cond; {2007#false} is VALID [2022-04-15 13:17:37,981 INFO L290 TraceCheckUtils]: 65: Hoare triple {2007#false} assume !false; {2007#false} is VALID [2022-04-15 13:17:37,982 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 13:17:37,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:37,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699015121] [2022-04-15 13:17:37,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699015121] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:37,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:37,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 13:17:37,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:37,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1534706432] [2022-04-15 13:17:37,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1534706432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:37,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:37,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 13:17:37,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99996688] [2022-04-15 13:17:37,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:37,984 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 13:17:37,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:37,985 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 13:17:38,025 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 13:17:38,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 13:17:38,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:38,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 13:17:38,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:17:38,026 INFO L87 Difference]: Start difference. First operand 93 states and 118 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 13:17:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:40,220 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2022-04-15 13:17:40,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 13:17:40,220 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 13:17:40,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:40,220 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 13:17:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 202 transitions. [2022-04-15 13:17:40,224 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 13:17:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 202 transitions. [2022-04-15 13:17:40,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 202 transitions. [2022-04-15 13:17:40,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:40,421 INFO L225 Difference]: With dead ends: 164 [2022-04-15 13:17:40,421 INFO L226 Difference]: Without dead ends: 99 [2022-04-15 13:17:40,422 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 13:17:40,423 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 141 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:40,423 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 84 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 13:17:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-15 13:17:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2022-04-15 13:17:40,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:40,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 95 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 60 states have internal predecessors, (66), 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 13:17:40,450 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 95 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 60 states have internal predecessors, (66), 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 13:17:40,450 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 95 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 60 states have internal predecessors, (66), 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 13:17:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:40,453 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2022-04-15 13:17:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2022-04-15 13:17:40,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:40,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:40,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 60 states have internal predecessors, (66), 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 99 states. [2022-04-15 13:17:40,454 INFO L87 Difference]: Start difference. First operand has 95 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 60 states have internal predecessors, (66), 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 99 states. [2022-04-15 13:17:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:40,457 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2022-04-15 13:17:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2022-04-15 13:17:40,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:40,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:40,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:40,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 60 states have internal predecessors, (66), 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 13:17:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2022-04-15 13:17:40,461 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 66 [2022-04-15 13:17:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:40,461 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2022-04-15 13:17:40,461 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 13:17:40,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 121 transitions. [2022-04-15 13:17:40,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2022-04-15 13:17:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 13:17:40,609 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:40,609 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 13:17:40,609 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:17:40,609 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:40,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:40,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1818938389, now seen corresponding path program 1 times [2022-04-15 13:17:40,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:40,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [343799952] [2022-04-15 13:17:40,610 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:17:40,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1818938389, now seen corresponding path program 2 times [2022-04-15 13:17:40,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:40,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125303876] [2022-04-15 13:17:40,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:40,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:40,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:17:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:40,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {2888#(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(16, 2);call #Ultimate.allocInit(12, 3); {2822#true} is VALID [2022-04-15 13:17:40,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2822#true} {2822#true} #197#return; {2822#true} is VALID [2022-04-15 13:17:40,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 13:17:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:40,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 13:17:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:40,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {2889#(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; {2822#true} is VALID [2022-04-15 13:17:40,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2822#true} {2890#(= nondet_tree_~n~0.offset 0)} #163#return; {2890#(= nondet_tree_~n~0.offset 0)} is VALID [2022-04-15 13:17:40,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:17:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:40,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {2889#(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; {2822#true} is VALID [2022-04-15 13:17:40,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2822#true} {2890#(= nondet_tree_~n~0.offset 0)} #165#return; {2890#(= nondet_tree_~n~0.offset 0)} is VALID [2022-04-15 13:17:40,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {2889#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume !(0 != #t~nondet5 % 256);havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(20);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet7; {2890#(= nondet_tree_~n~0.offset 0)} is VALID [2022-04-15 13:17:40,767 INFO L272 TraceCheckUtils]: 1: Hoare triple {2890#(= nondet_tree_~n~0.offset 0)} call #t~ret8.base, #t~ret8.offset := nondet_tree(); {2889#(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 13:17:40,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {2889#(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; {2822#true} is VALID [2022-04-15 13:17:40,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,768 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2822#true} {2890#(= nondet_tree_~n~0.offset 0)} #163#return; {2890#(= nondet_tree_~n~0.offset 0)} is VALID [2022-04-15 13:17:40,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {2890#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~n~0.base, 4 + ~n~0.offset, 8);havoc #t~ret8.base, #t~ret8.offset; {2890#(= nondet_tree_~n~0.offset 0)} is VALID [2022-04-15 13:17:40,768 INFO L272 TraceCheckUtils]: 6: Hoare triple {2890#(= nondet_tree_~n~0.offset 0)} call #t~ret9.base, #t~ret9.offset := nondet_tree(); {2889#(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 13:17:40,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {2889#(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; {2822#true} is VALID [2022-04-15 13:17:40,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,769 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2822#true} {2890#(= nondet_tree_~n~0.offset 0)} #165#return; {2890#(= nondet_tree_~n~0.offset 0)} is VALID [2022-04-15 13:17:40,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {2890#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret9.base, #t~ret9.offset, ~n~0.base, 12 + ~n~0.offset, 8);havoc #t~ret9.base, #t~ret9.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2897#(= |nondet_tree_#res.offset| 0)} is VALID [2022-04-15 13:17:40,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {2897#(= |nondet_tree_#res.offset| 0)} assume true; {2897#(= |nondet_tree_#res.offset| 0)} is VALID [2022-04-15 13:17:40,770 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2897#(= |nondet_tree_#res.offset| 0)} {2822#true} #155#return; {2840#(= |main_#t~ret45.offset| 0)} is VALID [2022-04-15 13:17:40,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 13:17:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:40,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 13:17:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:40,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {2822#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2822#true} is VALID [2022-04-15 13:17:40,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {2822#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2822#true} is VALID [2022-04-15 13:17:40,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2822#true} {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} #159#return; {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} is VALID [2022-04-15 13:17:40,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-15 13:17:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:40,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {2822#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2822#true} is VALID [2022-04-15 13:17:40,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {2822#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2822#true} is VALID [2022-04-15 13:17:40,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2822#true} {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} #161#return; {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} is VALID [2022-04-15 13:17:40,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {2822#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2898#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} is VALID [2022-04-15 13:17:40,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {2898#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem10 := read~int(~n.base, ~n.offset, 4);~a~0 := #t~mem10;havoc #t~mem10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 8); {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} is VALID [2022-04-15 13:17:40,807 INFO L272 TraceCheckUtils]: 2: Hoare triple {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} call #t~ret12 := min(#t~mem11.base, #t~mem11.offset); {2822#true} is VALID [2022-04-15 13:17:40,807 INFO L290 TraceCheckUtils]: 3: Hoare triple {2822#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2822#true} is VALID [2022-04-15 13:17:40,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {2822#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2822#true} is VALID [2022-04-15 13:17:40,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,808 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2822#true} {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} #159#return; {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} is VALID [2022-04-15 13:17:40,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~b~0 := #t~ret12;havoc #t~mem11.base, #t~mem11.offset;havoc #t~ret12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~n.base, 12 + ~n.offset, 8); {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} is VALID [2022-04-15 13:17:40,808 INFO L272 TraceCheckUtils]: 8: Hoare triple {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} call #t~ret14 := min(#t~mem13.base, #t~mem13.offset); {2822#true} is VALID [2022-04-15 13:17:40,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {2822#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2822#true} is VALID [2022-04-15 13:17:40,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {2822#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2822#true} is VALID [2022-04-15 13:17:40,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,812 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2822#true} {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} #161#return; {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} is VALID [2022-04-15 13:17:40,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~c~0 := #t~ret14;havoc #t~mem13.base, #t~mem13.offset;havoc #t~ret14; {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} is VALID [2022-04-15 13:17:40,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} assume ~b~0 <= ~a~0 && ~b~0 <= ~c~0;#res := ~b~0; {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} is VALID [2022-04-15 13:17:40,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} assume true; {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} is VALID [2022-04-15 13:17:40,813 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} {2842#(= task_~t.offset 0)} #167#return; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:40,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-15 13:17:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:40,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 13:17:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:40,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {2822#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2822#true} is VALID [2022-04-15 13:17:40,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {2822#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2822#true} is VALID [2022-04-15 13:17:40,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2822#true} {2822#true} #193#return; {2822#true} is VALID [2022-04-15 13:17:40,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-15 13:17:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:40,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {2822#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2822#true} is VALID [2022-04-15 13:17:40,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {2822#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2822#true} is VALID [2022-04-15 13:17:40,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2822#true} {2822#true} #195#return; {2822#true} is VALID [2022-04-15 13:17:40,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {2822#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2822#true} is VALID [2022-04-15 13:17:40,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {2822#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {2822#true} is VALID [2022-04-15 13:17:40,825 INFO L272 TraceCheckUtils]: 2: Hoare triple {2822#true} call #t~ret29 := size(#t~mem28.base, #t~mem28.offset); {2822#true} is VALID [2022-04-15 13:17:40,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {2822#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2822#true} is VALID [2022-04-15 13:17:40,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {2822#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2822#true} is VALID [2022-04-15 13:17:40,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,825 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2822#true} {2822#true} #193#return; {2822#true} is VALID [2022-04-15 13:17:40,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {2822#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {2822#true} is VALID [2022-04-15 13:17:40,826 INFO L272 TraceCheckUtils]: 8: Hoare triple {2822#true} call #t~ret31 := size(#t~mem30.base, #t~mem30.offset); {2822#true} is VALID [2022-04-15 13:17:40,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {2822#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2822#true} is VALID [2022-04-15 13:17:40,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {2822#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2822#true} is VALID [2022-04-15 13:17:40,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,826 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2822#true} {2822#true} #195#return; {2822#true} is VALID [2022-04-15 13:17:40,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {2822#true} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;#res := 1 + (#t~ret29 + #t~ret31);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29;havoc #t~mem30.base, #t~mem30.offset;havoc #t~ret31; {2822#true} is VALID [2022-04-15 13:17:40,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,826 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2822#true} {2860#(not (= task_~t.base 0))} #169#return; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:40,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-15 13:17:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:40,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-15 13:17:40,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-15 13:17:40,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2822#true} {2860#(not (= task_~t.base 0))} #171#return; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:40,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-15 13:17:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:40,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {2916#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2822#true} is VALID [2022-04-15 13:17:40,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,840 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2822#true} {2860#(not (= task_~t.base 0))} #173#return; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:40,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-04-15 13:17:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:40,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {2917#(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; {2918#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2022-04-15 13:17:40,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {2918#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2919#(= |tree_inorder_#in~t.base| 0)} is VALID [2022-04-15 13:17:40,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {2919#(= |tree_inorder_#in~t.base| 0)} assume true; {2919#(= |tree_inorder_#in~t.base| 0)} is VALID [2022-04-15 13:17:40,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2919#(= |tree_inorder_#in~t.base| 0)} {2860#(not (= task_~t.base 0))} #175#return; {2823#false} is VALID [2022-04-15 13:17:40,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {2822#true} call ULTIMATE.init(); {2888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:17:40,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {2888#(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(16, 2);call #Ultimate.allocInit(12, 3); {2822#true} is VALID [2022-04-15 13:17:40,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2822#true} {2822#true} #197#return; {2822#true} is VALID [2022-04-15 13:17:40,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {2822#true} call #t~ret46 := main(); {2822#true} is VALID [2022-04-15 13:17:40,871 INFO L272 TraceCheckUtils]: 5: Hoare triple {2822#true} call #t~ret45.base, #t~ret45.offset := nondet_tree(); {2889#(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 13:17:40,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {2889#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume !(0 != #t~nondet5 % 256);havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(20);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet7; {2890#(= nondet_tree_~n~0.offset 0)} is VALID [2022-04-15 13:17:40,872 INFO L272 TraceCheckUtils]: 7: Hoare triple {2890#(= nondet_tree_~n~0.offset 0)} call #t~ret8.base, #t~ret8.offset := nondet_tree(); {2889#(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 13:17:40,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {2889#(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; {2822#true} is VALID [2022-04-15 13:17:40,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,873 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2822#true} {2890#(= nondet_tree_~n~0.offset 0)} #163#return; {2890#(= nondet_tree_~n~0.offset 0)} is VALID [2022-04-15 13:17:40,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {2890#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~n~0.base, 4 + ~n~0.offset, 8);havoc #t~ret8.base, #t~ret8.offset; {2890#(= nondet_tree_~n~0.offset 0)} is VALID [2022-04-15 13:17:40,873 INFO L272 TraceCheckUtils]: 12: Hoare triple {2890#(= nondet_tree_~n~0.offset 0)} call #t~ret9.base, #t~ret9.offset := nondet_tree(); {2889#(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 13:17:40,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {2889#(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; {2822#true} is VALID [2022-04-15 13:17:40,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,874 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2822#true} {2890#(= nondet_tree_~n~0.offset 0)} #165#return; {2890#(= nondet_tree_~n~0.offset 0)} is VALID [2022-04-15 13:17:40,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {2890#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret9.base, #t~ret9.offset, ~n~0.base, 12 + ~n~0.offset, 8);havoc #t~ret9.base, #t~ret9.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2897#(= |nondet_tree_#res.offset| 0)} is VALID [2022-04-15 13:17:40,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {2897#(= |nondet_tree_#res.offset| 0)} assume true; {2897#(= |nondet_tree_#res.offset| 0)} is VALID [2022-04-15 13:17:40,875 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2897#(= |nondet_tree_#res.offset| 0)} {2822#true} #155#return; {2840#(= |main_#t~ret45.offset| 0)} is VALID [2022-04-15 13:17:40,875 INFO L272 TraceCheckUtils]: 19: Hoare triple {2840#(= |main_#t~ret45.offset| 0)} call task(#t~ret45.base, #t~ret45.offset); {2841#(= |task_#in~t.offset| 0)} is VALID [2022-04-15 13:17:40,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {2841#(= |task_#in~t.offset| 0)} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2842#(= task_~t.offset 0)} is VALID [2022-04-15 13:17:40,876 INFO L272 TraceCheckUtils]: 21: Hoare triple {2842#(= task_~t.offset 0)} call #t~ret32 := min(~t.base, ~t.offset); {2822#true} is VALID [2022-04-15 13:17:40,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {2822#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2898#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} is VALID [2022-04-15 13:17:40,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {2898#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem10 := read~int(~n.base, ~n.offset, 4);~a~0 := #t~mem10;havoc #t~mem10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 8); {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} is VALID [2022-04-15 13:17:40,876 INFO L272 TraceCheckUtils]: 24: Hoare triple {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} call #t~ret12 := min(#t~mem11.base, #t~mem11.offset); {2822#true} is VALID [2022-04-15 13:17:40,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {2822#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2822#true} is VALID [2022-04-15 13:17:40,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {2822#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2822#true} is VALID [2022-04-15 13:17:40,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,877 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2822#true} {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} #159#return; {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} is VALID [2022-04-15 13:17:40,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~b~0 := #t~ret12;havoc #t~mem11.base, #t~mem11.offset;havoc #t~ret12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~n.base, 12 + ~n.offset, 8); {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} is VALID [2022-04-15 13:17:40,877 INFO L272 TraceCheckUtils]: 30: Hoare triple {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} call #t~ret14 := min(#t~mem13.base, #t~mem13.offset); {2822#true} is VALID [2022-04-15 13:17:40,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {2822#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2822#true} is VALID [2022-04-15 13:17:40,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {2822#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2822#true} is VALID [2022-04-15 13:17:40,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,878 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2822#true} {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} #161#return; {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} is VALID [2022-04-15 13:17:40,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~c~0 := #t~ret14;havoc #t~mem13.base, #t~mem13.offset;havoc #t~ret14; {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} is VALID [2022-04-15 13:17:40,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} assume ~b~0 <= ~a~0 && ~b~0 <= ~c~0;#res := ~b~0; {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} is VALID [2022-04-15 13:17:40,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} assume true; {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} is VALID [2022-04-15 13:17:40,879 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2899#(or (not (= |min_#in~n.offset| 0)) (not (= |min_#in~n.base| 0)))} {2842#(= task_~t.offset 0)} #167#return; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:40,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {2860#(not (= task_~t.base 0))} assume -2147483648 <= #t~ret32 && #t~ret32 <= 2147483647;~a~1 := #t~ret32;havoc #t~ret32;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:40,879 INFO L272 TraceCheckUtils]: 40: Hoare triple {2860#(not (= task_~t.base 0))} call #t~ret33 := size(~t.base, ~t.offset); {2822#true} is VALID [2022-04-15 13:17:40,880 INFO L290 TraceCheckUtils]: 41: Hoare triple {2822#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2822#true} is VALID [2022-04-15 13:17:40,880 INFO L290 TraceCheckUtils]: 42: Hoare triple {2822#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {2822#true} is VALID [2022-04-15 13:17:40,880 INFO L272 TraceCheckUtils]: 43: Hoare triple {2822#true} call #t~ret29 := size(#t~mem28.base, #t~mem28.offset); {2822#true} is VALID [2022-04-15 13:17:40,880 INFO L290 TraceCheckUtils]: 44: Hoare triple {2822#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2822#true} is VALID [2022-04-15 13:17:40,880 INFO L290 TraceCheckUtils]: 45: Hoare triple {2822#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2822#true} is VALID [2022-04-15 13:17:40,880 INFO L290 TraceCheckUtils]: 46: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,880 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2822#true} {2822#true} #193#return; {2822#true} is VALID [2022-04-15 13:17:40,880 INFO L290 TraceCheckUtils]: 48: Hoare triple {2822#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {2822#true} is VALID [2022-04-15 13:17:40,880 INFO L272 TraceCheckUtils]: 49: Hoare triple {2822#true} call #t~ret31 := size(#t~mem30.base, #t~mem30.offset); {2822#true} is VALID [2022-04-15 13:17:40,880 INFO L290 TraceCheckUtils]: 50: Hoare triple {2822#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2822#true} is VALID [2022-04-15 13:17:40,880 INFO L290 TraceCheckUtils]: 51: Hoare triple {2822#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2822#true} is VALID [2022-04-15 13:17:40,880 INFO L290 TraceCheckUtils]: 52: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,880 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2822#true} {2822#true} #195#return; {2822#true} is VALID [2022-04-15 13:17:40,880 INFO L290 TraceCheckUtils]: 54: Hoare triple {2822#true} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;#res := 1 + (#t~ret29 + #t~ret31);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29;havoc #t~mem30.base, #t~mem30.offset;havoc #t~ret31; {2822#true} is VALID [2022-04-15 13:17:40,880 INFO L290 TraceCheckUtils]: 55: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,881 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2822#true} {2860#(not (= task_~t.base 0))} #169#return; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:40,881 INFO L290 TraceCheckUtils]: 57: Hoare triple {2860#(not (= task_~t.base 0))} assume -2147483648 <= #t~ret33 && #t~ret33 <= 2147483647;~n~1 := #t~ret33;havoc #t~ret33; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:40,881 INFO L272 TraceCheckUtils]: 58: Hoare triple {2860#(not (= task_~t.base 0))} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {2822#true} is VALID [2022-04-15 13:17:40,881 INFO L290 TraceCheckUtils]: 59: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-15 13:17:40,881 INFO L290 TraceCheckUtils]: 60: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-15 13:17:40,881 INFO L290 TraceCheckUtils]: 61: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,882 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {2822#true} {2860#(not (= task_~t.base 0))} #171#return; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:40,882 INFO L290 TraceCheckUtils]: 63: Hoare triple {2860#(not (= task_~t.base 0))} call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:40,882 INFO L272 TraceCheckUtils]: 64: Hoare triple {2860#(not (= task_~t.base 0))} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, ~n~1, 4, 4 * ~n~1); {2916#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 13:17:40,882 INFO L290 TraceCheckUtils]: 65: Hoare triple {2916#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2822#true} is VALID [2022-04-15 13:17:40,883 INFO L290 TraceCheckUtils]: 66: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:40,883 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {2822#true} {2860#(not (= task_~t.base 0))} #173#return; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:40,883 INFO L290 TraceCheckUtils]: 68: Hoare triple {2860#(not (= task_~t.base 0))} ~x~0.base, ~x~0.offset := #t~malloc34.base, #t~malloc34.offset; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:40,884 INFO L272 TraceCheckUtils]: 69: Hoare triple {2860#(not (= task_~t.base 0))} call #t~ret35 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2917#(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 13:17:40,884 INFO L290 TraceCheckUtils]: 70: Hoare triple {2917#(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; {2918#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2022-04-15 13:17:40,884 INFO L290 TraceCheckUtils]: 71: Hoare triple {2918#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2919#(= |tree_inorder_#in~t.base| 0)} is VALID [2022-04-15 13:17:40,885 INFO L290 TraceCheckUtils]: 72: Hoare triple {2919#(= |tree_inorder_#in~t.base| 0)} assume true; {2919#(= |tree_inorder_#in~t.base| 0)} is VALID [2022-04-15 13:17:40,885 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {2919#(= |tree_inorder_#in~t.base| 0)} {2860#(not (= task_~t.base 0))} #175#return; {2823#false} is VALID [2022-04-15 13:17:40,885 INFO L290 TraceCheckUtils]: 74: Hoare triple {2823#false} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;call #t~mem36 := read~int(~x~0.base, ~x~0.offset, 4); {2823#false} is VALID [2022-04-15 13:17:40,886 INFO L272 TraceCheckUtils]: 75: Hoare triple {2823#false} call __VERIFIER_assert((if ~a~1 == #t~mem36 then 1 else 0)); {2823#false} is VALID [2022-04-15 13:17:40,886 INFO L290 TraceCheckUtils]: 76: Hoare triple {2823#false} ~cond := #in~cond; {2823#false} is VALID [2022-04-15 13:17:40,886 INFO L290 TraceCheckUtils]: 77: Hoare triple {2823#false} assume 0 == ~cond; {2823#false} is VALID [2022-04-15 13:17:40,886 INFO L290 TraceCheckUtils]: 78: Hoare triple {2823#false} assume !false; {2823#false} is VALID [2022-04-15 13:17:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-15 13:17:40,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:40,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125303876] [2022-04-15 13:17:40,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125303876] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:17:40,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75119965] [2022-04-15 13:17:40,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:17:40,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:40,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:17:40,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:17:40,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 13:17:40,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:17:40,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:17:40,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 13:17:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:41,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:17:41,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {2822#true} call ULTIMATE.init(); {2822#true} is VALID [2022-04-15 13:17:41,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {2822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2822#true} is VALID [2022-04-15 13:17:41,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:41,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2822#true} {2822#true} #197#return; {2822#true} is VALID [2022-04-15 13:17:41,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {2822#true} call #t~ret46 := main(); {2822#true} is VALID [2022-04-15 13:17:41,222 INFO L272 TraceCheckUtils]: 5: Hoare triple {2822#true} call #t~ret45.base, #t~ret45.offset := nondet_tree(); {2822#true} is VALID [2022-04-15 13:17:41,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {2822#true} assume !(0 != #t~nondet5 % 256);havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(20);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet7; {2941#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-15 13:17:41,223 INFO L272 TraceCheckUtils]: 7: Hoare triple {2941#(not (= nondet_tree_~n~0.base 0))} call #t~ret8.base, #t~ret8.offset := nondet_tree(); {2822#true} is VALID [2022-04-15 13:17:41,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {2822#true} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {2822#true} is VALID [2022-04-15 13:17:41,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:41,224 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2822#true} {2941#(not (= nondet_tree_~n~0.base 0))} #163#return; {2941#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-15 13:17:41,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {2941#(not (= nondet_tree_~n~0.base 0))} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~n~0.base, 4 + ~n~0.offset, 8);havoc #t~ret8.base, #t~ret8.offset; {2941#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-15 13:17:41,224 INFO L272 TraceCheckUtils]: 12: Hoare triple {2941#(not (= nondet_tree_~n~0.base 0))} call #t~ret9.base, #t~ret9.offset := nondet_tree(); {2822#true} is VALID [2022-04-15 13:17:41,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {2822#true} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {2822#true} is VALID [2022-04-15 13:17:41,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:41,225 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2822#true} {2941#(not (= nondet_tree_~n~0.base 0))} #165#return; {2941#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-15 13:17:41,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {2941#(not (= nondet_tree_~n~0.base 0))} call write~$Pointer$(#t~ret9.base, #t~ret9.offset, ~n~0.base, 12 + ~n~0.offset, 8);havoc #t~ret9.base, #t~ret9.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2972#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-15 13:17:41,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {2972#(not (= |nondet_tree_#res.base| 0))} assume true; {2972#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-15 13:17:41,226 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2972#(not (= |nondet_tree_#res.base| 0))} {2822#true} #155#return; {2979#(not (= |main_#t~ret45.base| 0))} is VALID [2022-04-15 13:17:41,227 INFO L272 TraceCheckUtils]: 19: Hoare triple {2979#(not (= |main_#t~ret45.base| 0))} call task(#t~ret45.base, #t~ret45.offset); {2983#(not (= |task_#in~t.base| 0))} is VALID [2022-04-15 13:17:41,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {2983#(not (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:41,227 INFO L272 TraceCheckUtils]: 21: Hoare triple {2860#(not (= task_~t.base 0))} call #t~ret32 := min(~t.base, ~t.offset); {2822#true} is VALID [2022-04-15 13:17:41,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {2822#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2822#true} is VALID [2022-04-15 13:17:41,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {2822#true} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem10 := read~int(~n.base, ~n.offset, 4);~a~0 := #t~mem10;havoc #t~mem10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 8); {2822#true} is VALID [2022-04-15 13:17:41,227 INFO L272 TraceCheckUtils]: 24: Hoare triple {2822#true} call #t~ret12 := min(#t~mem11.base, #t~mem11.offset); {2822#true} is VALID [2022-04-15 13:17:41,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {2822#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2822#true} is VALID [2022-04-15 13:17:41,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {2822#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2822#true} is VALID [2022-04-15 13:17:41,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:41,228 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2822#true} {2822#true} #159#return; {2822#true} is VALID [2022-04-15 13:17:41,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {2822#true} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~b~0 := #t~ret12;havoc #t~mem11.base, #t~mem11.offset;havoc #t~ret12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~n.base, 12 + ~n.offset, 8); {2822#true} is VALID [2022-04-15 13:17:41,228 INFO L272 TraceCheckUtils]: 30: Hoare triple {2822#true} call #t~ret14 := min(#t~mem13.base, #t~mem13.offset); {2822#true} is VALID [2022-04-15 13:17:41,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {2822#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2822#true} is VALID [2022-04-15 13:17:41,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {2822#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2822#true} is VALID [2022-04-15 13:17:41,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:41,228 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2822#true} {2822#true} #161#return; {2822#true} is VALID [2022-04-15 13:17:41,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {2822#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~c~0 := #t~ret14;havoc #t~mem13.base, #t~mem13.offset;havoc #t~ret14; {2822#true} is VALID [2022-04-15 13:17:41,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {2822#true} assume ~b~0 <= ~a~0 && ~b~0 <= ~c~0;#res := ~b~0; {2822#true} is VALID [2022-04-15 13:17:41,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:41,229 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2822#true} {2860#(not (= task_~t.base 0))} #167#return; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:41,229 INFO L290 TraceCheckUtils]: 39: Hoare triple {2860#(not (= task_~t.base 0))} assume -2147483648 <= #t~ret32 && #t~ret32 <= 2147483647;~a~1 := #t~ret32;havoc #t~ret32;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:41,229 INFO L272 TraceCheckUtils]: 40: Hoare triple {2860#(not (= task_~t.base 0))} call #t~ret33 := size(~t.base, ~t.offset); {2822#true} is VALID [2022-04-15 13:17:41,229 INFO L290 TraceCheckUtils]: 41: Hoare triple {2822#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2822#true} is VALID [2022-04-15 13:17:41,229 INFO L290 TraceCheckUtils]: 42: Hoare triple {2822#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 8); {2822#true} is VALID [2022-04-15 13:17:41,229 INFO L272 TraceCheckUtils]: 43: Hoare triple {2822#true} call #t~ret29 := size(#t~mem28.base, #t~mem28.offset); {2822#true} is VALID [2022-04-15 13:17:41,229 INFO L290 TraceCheckUtils]: 44: Hoare triple {2822#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2822#true} is VALID [2022-04-15 13:17:41,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {2822#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2822#true} is VALID [2022-04-15 13:17:41,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:41,229 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2822#true} {2822#true} #193#return; {2822#true} is VALID [2022-04-15 13:17:41,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {2822#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~t.base, 12 + ~t.offset, 8); {2822#true} is VALID [2022-04-15 13:17:41,230 INFO L272 TraceCheckUtils]: 49: Hoare triple {2822#true} call #t~ret31 := size(#t~mem30.base, #t~mem30.offset); {2822#true} is VALID [2022-04-15 13:17:41,230 INFO L290 TraceCheckUtils]: 50: Hoare triple {2822#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2822#true} is VALID [2022-04-15 13:17:41,230 INFO L290 TraceCheckUtils]: 51: Hoare triple {2822#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2822#true} is VALID [2022-04-15 13:17:41,230 INFO L290 TraceCheckUtils]: 52: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:41,230 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2822#true} {2822#true} #195#return; {2822#true} is VALID [2022-04-15 13:17:41,230 INFO L290 TraceCheckUtils]: 54: Hoare triple {2822#true} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;#res := 1 + (#t~ret29 + #t~ret31);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29;havoc #t~mem30.base, #t~mem30.offset;havoc #t~ret31; {2822#true} is VALID [2022-04-15 13:17:41,230 INFO L290 TraceCheckUtils]: 55: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:41,230 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2822#true} {2860#(not (= task_~t.base 0))} #169#return; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:41,231 INFO L290 TraceCheckUtils]: 57: Hoare triple {2860#(not (= task_~t.base 0))} assume -2147483648 <= #t~ret33 && #t~ret33 <= 2147483647;~n~1 := #t~ret33;havoc #t~ret33; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:41,231 INFO L272 TraceCheckUtils]: 58: Hoare triple {2860#(not (= task_~t.base 0))} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {2822#true} is VALID [2022-04-15 13:17:41,231 INFO L290 TraceCheckUtils]: 59: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-15 13:17:41,231 INFO L290 TraceCheckUtils]: 60: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-15 13:17:41,231 INFO L290 TraceCheckUtils]: 61: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:41,231 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {2822#true} {2860#(not (= task_~t.base 0))} #171#return; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:41,231 INFO L290 TraceCheckUtils]: 63: Hoare triple {2860#(not (= task_~t.base 0))} call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:41,232 INFO L272 TraceCheckUtils]: 64: Hoare triple {2860#(not (= task_~t.base 0))} call #Ultimate.meminit(#t~malloc34.base, #t~malloc34.offset, ~n~1, 4, 4 * ~n~1); {2822#true} is VALID [2022-04-15 13:17:41,232 INFO L290 TraceCheckUtils]: 65: Hoare triple {2822#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2822#true} is VALID [2022-04-15 13:17:41,232 INFO L290 TraceCheckUtils]: 66: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-15 13:17:41,232 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {2822#true} {2860#(not (= task_~t.base 0))} #173#return; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:41,233 INFO L290 TraceCheckUtils]: 68: Hoare triple {2860#(not (= task_~t.base 0))} ~x~0.base, ~x~0.offset := #t~malloc34.base, #t~malloc34.offset; {2860#(not (= task_~t.base 0))} is VALID [2022-04-15 13:17:41,233 INFO L272 TraceCheckUtils]: 69: Hoare triple {2860#(not (= task_~t.base 0))} call #t~ret35 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2822#true} is VALID [2022-04-15 13:17:41,233 INFO L290 TraceCheckUtils]: 70: Hoare triple {2822#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2918#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2022-04-15 13:17:41,233 INFO L290 TraceCheckUtils]: 71: Hoare triple {2918#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2919#(= |tree_inorder_#in~t.base| 0)} is VALID [2022-04-15 13:17:41,233 INFO L290 TraceCheckUtils]: 72: Hoare triple {2919#(= |tree_inorder_#in~t.base| 0)} assume true; {2919#(= |tree_inorder_#in~t.base| 0)} is VALID [2022-04-15 13:17:41,234 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {2919#(= |tree_inorder_#in~t.base| 0)} {2860#(not (= task_~t.base 0))} #175#return; {2823#false} is VALID [2022-04-15 13:17:41,234 INFO L290 TraceCheckUtils]: 74: Hoare triple {2823#false} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;call #t~mem36 := read~int(~x~0.base, ~x~0.offset, 4); {2823#false} is VALID [2022-04-15 13:17:41,234 INFO L272 TraceCheckUtils]: 75: Hoare triple {2823#false} call __VERIFIER_assert((if ~a~1 == #t~mem36 then 1 else 0)); {2823#false} is VALID [2022-04-15 13:17:41,234 INFO L290 TraceCheckUtils]: 76: Hoare triple {2823#false} ~cond := #in~cond; {2823#false} is VALID [2022-04-15 13:17:41,234 INFO L290 TraceCheckUtils]: 77: Hoare triple {2823#false} assume 0 == ~cond; {2823#false} is VALID [2022-04-15 13:17:41,235 INFO L290 TraceCheckUtils]: 78: Hoare triple {2823#false} assume !false; {2823#false} is VALID [2022-04-15 13:17:41,235 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 13:17:41,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:17:41,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75119965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:41,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 13:17:41,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 20 [2022-04-15 13:17:41,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:41,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [343799952] [2022-04-15 13:17:41,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [343799952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:41,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:41,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:17:41,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253979034] [2022-04-15 13:17:41,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:41,236 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 3 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 13:17:41,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:41,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 3 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 13:17:41,286 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 13:17:41,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:17:41,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:41,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:17:41,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2022-04-15 13:17:41,287 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 3 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 13:17:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:41,864 INFO L93 Difference]: Finished difference Result 150 states and 192 transitions. [2022-04-15 13:17:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:17:41,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 3 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 13:17:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 3 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 13:17:41,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2022-04-15 13:17:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 3 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 13:17:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2022-04-15 13:17:41,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 181 transitions. [2022-04-15 13:17:42,004 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 13:17:42,007 INFO L225 Difference]: With dead ends: 150 [2022-04-15 13:17:42,007 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 13:17:42,007 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2022-04-15 13:17:42,008 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 35 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:42,008 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 706 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:17:42,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 13:17:42,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-04-15 13:17:42,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:42,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 62 states have internal predecessors, (67), 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 13:17:42,037 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 62 states have internal predecessors, (67), 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 13:17:42,037 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 62 states have internal predecessors, (67), 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 13:17:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:42,040 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-15 13:17:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2022-04-15 13:17:42,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:42,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:42,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 62 states have internal predecessors, (67), 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 97 states. [2022-04-15 13:17:42,041 INFO L87 Difference]: Start difference. First operand has 97 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 62 states have internal predecessors, (67), 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 97 states. [2022-04-15 13:17:42,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:42,045 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-15 13:17:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2022-04-15 13:17:42,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:42,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:42,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:42,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 62 states have internal predecessors, (67), 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 13:17:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2022-04-15 13:17:42,050 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 79 [2022-04-15 13:17:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:42,050 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2022-04-15 13:17:42,050 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 3 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 13:17:42,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 125 transitions. [2022-04-15 13:17:42,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2022-04-15 13:17:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 13:17:42,188 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:42,188 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 13:17:42,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 13:17:42,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 13:17:42,396 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:42,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:42,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1854783018, now seen corresponding path program 1 times [2022-04-15 13:17:42,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:42,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1080837598] [2022-04-15 13:17:42,397 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:17:42,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1854783018, now seen corresponding path program 2 times [2022-04-15 13:17:42,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:42,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632997973] [2022-04-15 13:17:42,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:42,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:17:42,440 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:17:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:17:42,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:17:42,505 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 13:17:42,505 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 13:17:42,507 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 13:17:42,509 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 13:17:42,511 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2] [2022-04-15 13:17:42,513 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: tree_delENTRY has no Hoare annotation [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: minENTRY has no Hoare annotation [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: taskENTRY has no Hoare annotation [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: sizeENTRY has no Hoare annotation [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: assume_cycle_if_notENTRY has no Hoare annotation [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: tree_inorderENTRY has no Hoare annotation [2022-04-15 13:17:42,539 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: nondet_treeFINAL has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2022-04-15 13:17:42,540 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: minFINAL has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: sizeFINAL has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L9-5 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: tree_inorderFINAL has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-04-15 13:17:42,541 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: tree_delFINAL has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: L59-3 has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: assume_cycle_if_notEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: tree_delEXIT has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-15 13:17:42,542 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L82-3 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L82-2 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L82-2 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-15 13:17:42,543 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: L103-3 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: L103-3 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: L103-3 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: L103-2 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: L103-4 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: taskFINAL has no Hoare annotation [2022-04-15 13:17:42,544 WARN L170 areAnnotationChecker]: taskEXIT has no Hoare annotation [2022-04-15 13:17:42,544 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 13:17:42,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:17:42 BoogieIcfgContainer [2022-04-15 13:17:42,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 13:17:42,546 INFO L158 Benchmark]: Toolchain (without parser) took 12534.65ms. Allocated memory was 195.0MB in the beginning and 338.7MB in the end (delta: 143.7MB). Free memory was 146.5MB in the beginning and 252.5MB in the end (delta: -106.0MB). Peak memory consumption was 38.6MB. Max. memory is 8.0GB. [2022-04-15 13:17:42,546 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 195.0MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:17:42,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.03ms. Allocated memory is still 195.0MB. Free memory was 146.2MB in the beginning and 168.3MB in the end (delta: -22.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 13:17:42,547 INFO L158 Benchmark]: Boogie Preprocessor took 50.15ms. Allocated memory is still 195.0MB. Free memory was 168.3MB in the beginning and 165.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-15 13:17:42,547 INFO L158 Benchmark]: RCFGBuilder took 513.54ms. Allocated memory is still 195.0MB. Free memory was 165.2MB in the beginning and 141.3MB in the end (delta: 23.9MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-04-15 13:17:42,547 INFO L158 Benchmark]: TraceAbstraction took 11769.08ms. Allocated memory was 195.0MB in the beginning and 338.7MB in the end (delta: 143.7MB). Free memory was 141.1MB in the beginning and 252.5MB in the end (delta: -111.4MB). Peak memory consumption was 33.8MB. Max. memory is 8.0GB. [2022-04-15 13:17:42,548 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.12ms. Allocated memory is still 195.0MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.03ms. Allocated memory is still 195.0MB. Free memory was 146.2MB in the beginning and 168.3MB in the end (delta: -22.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.15ms. Allocated memory is still 195.0MB. Free memory was 168.3MB in the beginning and 165.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 513.54ms. Allocated memory is still 195.0MB. Free memory was 165.2MB in the beginning and 141.3MB in the end (delta: 23.9MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 11769.08ms. Allocated memory was 195.0MB in the beginning and 338.7MB in the end (delta: 143.7MB). Free memory was 141.1MB in the beginning and 252.5MB in the end (delta: -111.4MB). Peak memory consumption was 33.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L110] 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; [L110] RET, EXPR nondet_tree() [L110] CALL task(nondet_tree()) [L86] CALL, EXPR min(t) [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left [L41] CALL, EXPR min(n->left) [L37] COND TRUE !n [L38] return 2147483647; [L41] RET, EXPR min(n->left) [L41] int b = min(n->left); [L42] EXPR n->right [L42] CALL, EXPR min(n->right) [L37] COND TRUE !n [L38] return 2147483647; [L42] RET, EXPR min(n->right) [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; [L86] RET, EXPR min(t) [L86] int a = min(t); [L87] int b; [L89] CALL, EXPR size(t) [L81] COND FALSE !(!t) [L82] EXPR t->left [L82] CALL, EXPR size(t->left) [L81] COND TRUE !t [L81] return 0; [L82] RET, EXPR size(t->left) [L82] EXPR t->right [L82] CALL, EXPR size(t->right) [L81] COND TRUE !t [L81] return 0; [L82] RET, EXPR size(t->right) [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) [L90] RET assume_cycle_if_not(n != 0) [L91] EXPR, FCALL calloc(n, sizeof(int)) [L91] int *x = calloc(n, sizeof(int)); [L92] CALL tree_inorder(t, x, n) [L70] COND FALSE !(!t) [L73] EXPR t->left [L73] CALL, EXPR tree_inorder(t->left, a, i) [L70] COND TRUE !t [L71] return i; [L73] RET, EXPR tree_inorder(t->left, a, i) [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right [L75] CALL, EXPR tree_inorder(t->right, a, i) [L70] COND TRUE !t [L71] return i; [L75] RET, EXPR tree_inorder(t->right, a, i) [L75] i = tree_inorder(t->right, a, i) [L76] return i; [L92] RET tree_inorder(t, x, n) [L93] EXPR x[0] [L93] CALL __VERIFIER_assert(a == x[0]) [L16] COND TRUE !cond [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 475 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 433 mSDsluCounter, 971 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 646 mSDsCounter, 390 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2539 IncrementalHoareTripleChecker+Invalid, 2929 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 390 mSolverCounterUnsat, 325 mSDtfsCounter, 2539 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 251 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 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 13:17:42,578 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...