/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:57:40,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:57:40,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:57:40,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:57:40,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:57:40,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:57:40,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:57:40,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:57:40,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:57:40,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:57:40,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:57:40,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:57:40,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:57:40,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:57:40,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:57:40,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:57:40,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:57:40,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:57:40,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:57:40,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:57:40,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:57:40,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:57:40,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:57:40,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:57:40,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:57:40,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:57:40,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:57:40,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:57:40,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:57:40,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:57:40,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:57:40,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:57:40,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:57:40,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:57:40,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:57:40,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:57:40,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:57:40,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:57:40,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:57:40,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:57:40,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:57:40,927 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:57:40,938 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:57:40,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:57:40,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:57:40,940 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:57:40,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:57:40,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:57:40,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:57:40,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:57:40,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:57:40,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:57:40,942 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:57:40,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:57:40,942 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:57:40,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:57:40,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:57:40,943 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:57:40,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:57:40,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:57:40,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:57:40,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:57:40,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:57:40,944 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:57:40,944 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 21:57:41,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:57:41,427 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:57:41,431 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:57:41,433 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:57:41,434 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:57:41,435 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec.c [2020-09-04 21:57:41,531 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d2d21bdbb/f3e269372cc3403b8faaab491fd2aa6d/FLAG0dd903ec3 [2020-09-04 21:57:42,095 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:57:42,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/verifythis/tree_del_rec.c [2020-09-04 21:57:42,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d2d21bdbb/f3e269372cc3403b8faaab491fd2aa6d/FLAG0dd903ec3 [2020-09-04 21:57:42,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d2d21bdbb/f3e269372cc3403b8faaab491fd2aa6d [2020-09-04 21:57:42,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:57:42,433 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:57:42,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:57:42,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:57:42,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:57:42,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:57:42" (1/1) ... [2020-09-04 21:57:42,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634162df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:42, skipping insertion in model container [2020-09-04 21:57:42,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:57:42" (1/1) ... [2020-09-04 21:57:42,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:57:42,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:57:42,764 WARN L1484 CHandler]: Possible shadowing of function min [2020-09-04 21:57:42,766 WARN L1484 CHandler]: Possible shadowing of function min [2020-09-04 21:57:42,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:57:42,803 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:57:42,917 WARN L1484 CHandler]: Possible shadowing of function min [2020-09-04 21:57:42,919 WARN L1484 CHandler]: Possible shadowing of function min [2020-09-04 21:57:42,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:57:42,956 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:57:42,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:42 WrapperNode [2020-09-04 21:57:42,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:57:42,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:57:42,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:57:42,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:57:42,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:42" (1/1) ... [2020-09-04 21:57:42,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:42" (1/1) ... [2020-09-04 21:57:42,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:42" (1/1) ... [2020-09-04 21:57:42,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:42" (1/1) ... [2020-09-04 21:57:43,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:42" (1/1) ... [2020-09-04 21:57:43,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:42" (1/1) ... [2020-09-04 21:57:43,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:42" (1/1) ... [2020-09-04 21:57:43,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:57:43,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:57:43,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:57:43,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:57:43,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:42" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:57:43,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:57:43,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:57:43,118 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2020-09-04 21:57:43,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 21:57:43,118 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-09-04 21:57:43,118 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-09-04 21:57:43,119 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-09-04 21:57:43,119 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-09-04 21:57:43,119 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-09-04 21:57:43,119 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-09-04 21:57:43,119 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:57:43,120 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-09-04 21:57:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-09-04 21:57:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-09-04 21:57:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-09-04 21:57:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:57:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-09-04 21:57:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2020-09-04 21:57:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:57:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 21:57:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-09-04 21:57:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-09-04 21:57:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 21:57:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-04 21:57:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-09-04 21:57:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 21:57:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-09-04 21:57:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-09-04 21:57:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 21:57:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-09-04 21:57:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-09-04 21:57:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-09-04 21:57:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-04 21:57:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-09-04 21:57:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:57:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:57:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:57:43,741 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:57:43,741 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-09-04 21:57:43,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:57:43 BoogieIcfgContainer [2020-09-04 21:57:43,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:57:43,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:57:43,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:57:43,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:57:43,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:57:42" (1/3) ... [2020-09-04 21:57:43,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a74149c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:57:43, skipping insertion in model container [2020-09-04 21:57:43,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:42" (2/3) ... [2020-09-04 21:57:43,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a74149c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:57:43, skipping insertion in model container [2020-09-04 21:57:43,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:57:43" (3/3) ... [2020-09-04 21:57:43,759 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2020-09-04 21:57:43,772 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:57:43,783 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:57:43,806 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:57:43,836 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:57:43,837 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:57:43,837 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:57:43,837 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:57:43,837 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:57:43,838 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:57:43,838 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:57:43,838 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:57:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states. [2020-09-04 21:57:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-09-04 21:57:43,883 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:43,885 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:43,885 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:43,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:43,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2147081424, now seen corresponding path program 1 times [2020-09-04 21:57:43,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:43,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [155359329] [2020-09-04 21:57:43,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:44,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:44,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:57:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:44,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 21:57:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:44,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 21:57:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:44,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 21:57:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:44,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 21:57:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:44,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 21:57:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:57:44,410 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [155359329] [2020-09-04 21:57:44,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:57:44,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 21:57:44,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258576378] [2020-09-04 21:57:44,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:57:44,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:44,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:57:44,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:57:44,444 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 11 states. [2020-09-04 21:57:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:45,840 INFO L93 Difference]: Finished difference Result 333 states and 391 transitions. [2020-09-04 21:57:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:57:45,842 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2020-09-04 21:57:45,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:45,863 INFO L225 Difference]: With dead ends: 333 [2020-09-04 21:57:45,863 INFO L226 Difference]: Without dead ends: 193 [2020-09-04 21:57:45,870 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:57:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-09-04 21:57:45,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2020-09-04 21:57:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-09-04 21:57:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 204 transitions. [2020-09-04 21:57:45,960 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 204 transitions. Word has length 60 [2020-09-04 21:57:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:45,961 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 204 transitions. [2020-09-04 21:57:45,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:57:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 204 transitions. [2020-09-04 21:57:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-09-04 21:57:45,967 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:45,967 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:45,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:57:45,968 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:45,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:45,968 INFO L82 PathProgramCache]: Analyzing trace with hash 394479658, now seen corresponding path program 1 times [2020-09-04 21:57:45,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:45,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [268659667] [2020-09-04 21:57:45,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:46,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:46,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:57:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:46,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 21:57:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:46,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 21:57:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:46,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:46,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:57:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:46,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 21:57:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:46,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 21:57:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:46,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 21:57:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 21:57:46,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [268659667] [2020-09-04 21:57:46,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:46,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:57:46,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218578444] [2020-09-04 21:57:46,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:57:46,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:46,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:57:46,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:57:46,316 INFO L87 Difference]: Start difference. First operand 180 states and 204 transitions. Second operand 12 states. [2020-09-04 21:57:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:47,691 INFO L93 Difference]: Finished difference Result 321 states and 367 transitions. [2020-09-04 21:57:47,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 21:57:47,692 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2020-09-04 21:57:47,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:47,699 INFO L225 Difference]: With dead ends: 321 [2020-09-04 21:57:47,700 INFO L226 Difference]: Without dead ends: 192 [2020-09-04 21:57:47,708 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:57:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-09-04 21:57:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 182. [2020-09-04 21:57:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-09-04 21:57:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 207 transitions. [2020-09-04 21:57:47,777 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 207 transitions. Word has length 80 [2020-09-04 21:57:47,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:47,777 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 207 transitions. [2020-09-04 21:57:47,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:57:47,778 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 207 transitions. [2020-09-04 21:57:47,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-09-04 21:57:47,791 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:47,791 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:47,792 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:57:47,792 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:47,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:47,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1011523, now seen corresponding path program 1 times [2020-09-04 21:57:47,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:47,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1679334886] [2020-09-04 21:57:47,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:47,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:47,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:57:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:48,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:57:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:48,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 21:57:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:48,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:57:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:48,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:57:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:48,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:48,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:57:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:48,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 21:57:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:48,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:57:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:48,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 21:57:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-04 21:57:48,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1679334886] [2020-09-04 21:57:48,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:57:48,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 21:57:48,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588750581] [2020-09-04 21:57:48,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:57:48,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:48,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:57:48,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:57:48,216 INFO L87 Difference]: Start difference. First operand 182 states and 207 transitions. Second operand 14 states. [2020-09-04 21:57:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:49,648 INFO L93 Difference]: Finished difference Result 320 states and 366 transitions. [2020-09-04 21:57:49,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 21:57:49,649 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 101 [2020-09-04 21:57:49,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:49,652 INFO L225 Difference]: With dead ends: 320 [2020-09-04 21:57:49,652 INFO L226 Difference]: Without dead ends: 194 [2020-09-04 21:57:49,654 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:57:49,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-09-04 21:57:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 184. [2020-09-04 21:57:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-09-04 21:57:49,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 210 transitions. [2020-09-04 21:57:49,688 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 210 transitions. Word has length 101 [2020-09-04 21:57:49,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:49,689 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 210 transitions. [2020-09-04 21:57:49,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:57:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 210 transitions. [2020-09-04 21:57:49,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-09-04 21:57:49,692 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:49,692 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:49,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:57:49,693 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1431902021, now seen corresponding path program 1 times [2020-09-04 21:57:49,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:49,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [718758816] [2020-09-04 21:57:49,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:49,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:49,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:57:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:49,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:57:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:49,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 21:57:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:49,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:57:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:50,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:57:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:50,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 21:57:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:50,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 21:57:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:50,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:57:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:50,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:57:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:50,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 21:57:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:50,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 21:57:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:50,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-09-04 21:57:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:57:50,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [718758816] [2020-09-04 21:57:50,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:57:50,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 21:57:50,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099115753] [2020-09-04 21:57:50,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:57:50,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:50,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:57:50,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:57:50,161 INFO L87 Difference]: Start difference. First operand 184 states and 210 transitions. Second operand 14 states. [2020-09-04 21:57:51,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:51,610 INFO L93 Difference]: Finished difference Result 303 states and 345 transitions. [2020-09-04 21:57:51,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:57:51,611 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 127 [2020-09-04 21:57:51,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:51,616 INFO L225 Difference]: With dead ends: 303 [2020-09-04 21:57:51,616 INFO L226 Difference]: Without dead ends: 194 [2020-09-04 21:57:51,618 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2020-09-04 21:57:51,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-09-04 21:57:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 186. [2020-09-04 21:57:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-09-04 21:57:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 213 transitions. [2020-09-04 21:57:51,649 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 213 transitions. Word has length 127 [2020-09-04 21:57:51,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:51,650 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 213 transitions. [2020-09-04 21:57:51,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:57:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 213 transitions. [2020-09-04 21:57:51,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-09-04 21:57:51,653 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:51,653 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:51,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:57:51,654 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:51,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:51,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1422485650, now seen corresponding path program 1 times [2020-09-04 21:57:51,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:51,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1260674026] [2020-09-04 21:57:51,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:57:51,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:57:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:57:51,788 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:57:51,848 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 21:57:51,848 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 21:57:51,848 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:57:51,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:57:51 BoogieIcfgContainer [2020-09-04 21:57:51,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:57:51,944 INFO L168 Benchmark]: Toolchain (without parser) took 9510.87 ms. Allocated memory was 139.5 MB in the beginning and 311.4 MB in the end (delta: 172.0 MB). Free memory was 103.6 MB in the beginning and 266.6 MB in the end (delta: -163.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:57:51,945 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 139.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-09-04 21:57:51,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.47 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 103.4 MB in the beginning and 179.4 MB in the end (delta: -76.1 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2020-09-04 21:57:51,947 INFO L168 Benchmark]: Boogie Preprocessor took 74.99 ms. Allocated memory is still 202.9 MB. Free memory was 179.4 MB in the beginning and 176.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-09-04 21:57:51,948 INFO L168 Benchmark]: RCFGBuilder took 713.52 ms. Allocated memory is still 202.9 MB. Free memory was 176.8 MB in the beginning and 134.8 MB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:57:51,949 INFO L168 Benchmark]: TraceAbstraction took 8189.80 ms. Allocated memory was 202.9 MB in the beginning and 311.4 MB in the end (delta: 108.5 MB). Free memory was 134.1 MB in the beginning and 266.6 MB in the end (delta: -132.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 21:57:51,953 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 139.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 520.47 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 103.4 MB in the beginning and 179.4 MB in the end (delta: -76.1 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.99 ms. Allocated memory is still 202.9 MB. Free memory was 179.4 MB in the beginning and 176.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 713.52 ms. Allocated memory is still 202.9 MB. Free memory was 176.8 MB in the beginning and 134.8 MB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8189.80 ms. Allocated memory was 202.9 MB in the beginning and 311.4 MB in the end (delta: 108.5 MB). Free memory was 134.1 MB in the beginning and 266.6 MB in the end (delta: -132.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 14]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L100] CALL, EXPR nondet_tree() [L23] COND FALSE !(__VERIFIER_nondet_bool()) VAL [__VERIFIER_nondet_bool()=0] [L26] struct node *n = (struct node *)malloc(sizeof(struct node)); VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L27] n->data = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=2147483647, malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L28] CALL, EXPR nondet_tree() [L23] COND TRUE __VERIFIER_nondet_bool() VAL [__VERIFIER_nondet_bool()=1] [L24] return 0; VAL [\result={0:0}] [L28] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L28] n->left = nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L29] CALL, EXPR nondet_tree() [L23] COND TRUE __VERIFIER_nondet_bool() VAL [__VERIFIER_nondet_bool()=1] [L24] return 0; VAL [\result={0:0}] [L29] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L29] n->right = nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L30] return n; VAL [\result={-1:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L100] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L100] CALL task(nondet_tree()) VAL [t={-1:0}] [L76] CALL, EXPR min(t) VAL [n={-1:0}] [L35] COND FALSE !(!n) VAL [n={-1:0}, n={-1:0}] [L38] EXPR n->data VAL [n={-1:0}, n={-1:0}, n->data=2147483647] [L38] int a = n->data; VAL [a=2147483647, n={-1:0}, n={-1:0}, n->data=2147483647] [L39] EXPR n->left VAL [a=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L39] CALL, EXPR min(n->left) VAL [n={0:0}] [L35] COND TRUE !n VAL [n={0:0}, n={0:0}] [L36] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L39] RET, EXPR min(n->left) VAL [a=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L39] int b = min(n->left); VAL [a=2147483647, b=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L40] EXPR n->right VAL [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L40] CALL, EXPR min(n->right) VAL [n={0:0}] [L35] COND TRUE !n VAL [n={0:0}, n={0:0}] [L36] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L40] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L40] int c = min(n->right); VAL [a=2147483647, b=2147483647, c=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L41] COND TRUE b <= a && b <= c VAL [a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [L41] return b; VAL [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [L76] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L76] int a = min(t); VAL [a=2147483647, min(t)=2147483647, t={-1:0}, t={-1:0}] [L77] int b; VAL [a=2147483647, b={2:0}, t={-1:0}, t={-1:0}] [L79] CALL, EXPR size(t) VAL [t={-1:0}] [L71] COND FALSE !(!t) VAL [t={-1:0}, t={-1:0}] [L72] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L72] CALL, EXPR size(t->left) VAL [t={0:0}] [L71] COND TRUE !t VAL [t={0:0}, t={0:0}] [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L72] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L72] CALL, EXPR size(t->right) VAL [t={0:0}] [L71] COND TRUE !t VAL [t={0:0}, t={0:0}] [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L72] return size(t->left) + size(t->right) + 1; VAL [\result=1, size(t->left)=0, size(t->right)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L79] RET, EXPR size(t) VAL [a=2147483647, b={2:0}, size(t)=1, t={-1:0}, t={-1:0}] [L79] int n = size(t); VAL [a=2147483647, b={2:0}, n=1, size(t)=1, t={-1:0}, t={-1:0}] [L80] CALL assume_cycle_if_not(n != 0) VAL [\old(cond)=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume_cycle_if_not(n != 0) VAL [a=2147483647, b={2:0}, n=1, t={-1:0}, t={-1:0}] [L81] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}] [L81] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L82] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L60] COND FALSE !(!t) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}] [L63] EXPR t->left VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L60] COND TRUE !t VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L61] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L63] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L63] i = tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L64] EXPR i++ VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, i++=1, t={-1:0}, t={-1:0}] [L64] EXPR t->data VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, i++=1, t={-1:0}, t={-1:0}, t->data=2147483647] [L64] a[i++] = t->data VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, i++=1, t={-1:0}, t={-1:0}, t->data=2147483647] [L65] EXPR t->right VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L60] COND TRUE !t VAL [\old(i)=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L61] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L65] i = tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L66] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L82] RET tree_inorder(t, x, n) VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-2:0}] [L83] EXPR x[0] VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}, x[0]=0] [L83] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L14] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L14] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 190 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.0s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 686 SDtfs, 1400 SDslu, 2282 SDs, 0 SdLazy, 3917 SolverSat, 554 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=0, 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, 41 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 527 NumberOfCodeBlocks, 527 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 103440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 72/74 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...